login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A242227 a(n) = (2*n-1) * a(n-1) - a(n-2), a(0) = 1, a(1) = 2. 1
1, 2, 5, 23, 156, 1381, 15035, 194074, 2896075, 49039201, 928848744, 19456784423, 446577192985, 11144973040202, 300467694892469, 8702418178841399, 269474495849190900, 8883955944844458301, 310668983573706849635, 11485868436282308978194 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A053983(n) + A053984(n) = -(-1)^n * A121323(-2-n) for all integer n.
0 = a(n)*(a(n+2)) + a(n+1)*(-a(n+1) + 2*a(n+2) - a(n+3)) + a(n+2)*(a(n+2)) for all integer n.
EXAMPLE
G.f. = 1 + 2*x + 5*x^2 + 23*x^3 + 156*x^4 + 1381*x^5 + 15035*x^6 + ...
MATHEMATICA
RecurrenceTable[{a[n] == (2*n-1)*a[n-1] - a[n-2], a[0] == 1, a[1] == 2}, a, {n, 0, 50}] (* G. C. Greubel, Aug 06 2018 *)
nxt[{n_, a_, b_}]:={n+1, b, b(2n+1)-a}; NestList[nxt, {1, 1, 2}, 20][[All, 2]] (* Harvey P. Dale, Aug 01 2022 *)
PROG
(PARI) {a(n) = if( n>-4, if( n<0, -2-n, (2*n - 1) * a(n-1) - a(n-2)), (2*n + 3) * a(n+1) - a(n+2))};
(Magma) I:=[1, 2]; [n le 2 select I[n] else (2*n-1)*Self(n-1) - Self(n-2): n in [1..30]]; // G. C. Greubel, Aug 06 2018
CROSSREFS
Sequence in context: A003501 A006990 A358608 * A032182 A165902 A191600
KEYWORD
nonn
AUTHOR
Michael Somos, May 08 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 11 23:45 EDT 2024. Contains 375082 sequences. (Running on oeis4.)