I have been playing with the recurrence relation

\[ p_n = np_{n-1} + p_{n-2} \] such that \( p_0 = 0 , p_1 = 1 \).

I have found a few interesting difference forms for it but no closed form formula. Can anyone find a nice closed form formula, generating function or interpretation for what this might count.

All thoughts appreciated and welcome :)

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestWhenever you're investigating a sequence, it's not a bad idea to check the OEIS. This is entry A001053. There doesn't seem to be too much information.

Log in to reply

Thanks Jon, this is a nice idea :) I did have a quick look and agreed that there was not a lot of info! I will be having a look at bessel funtions soon to try get more intuition on the problem :)

Log in to reply