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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013989 a(n) = (n+1)*(a(n-1)/n + a(n-2)), with a(0)=1, a(1)=2. 10
 1, 2, 6, 16, 50, 156, 532, 1856, 6876, 26200, 104456, 428352, 1821976, 7959056, 35857200, 165592576, 785514512, 3812387616, 18948962656, 96194028800, 498931946016, 2638959243712, 14234346694976 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) is also the number of fixed points in all involutions (= self-inverse permutations) of {1,2,...,n+1}. Example: a(2)=6 because the involutions of {1,2,3} are 1'2'3', 1'32, 32'1, and 213', containing 6 fixed points (marked). - Emeric Deutsch, May 28 2009 a(n) is also the number of adjacent transpositions in all involutions (= self-inverse permutations) of {1,2,...,n+2}. Example: a(2)=6 because the involutions of {1,2,3,4} are 1234, 124*3, 13*24, 1432, 2*134, 2*14*3, 3214, 3412, 4231, and 43*21, containing 6 adjacent transpositions (marked with *). - Emeric Deutsch, Jun 08 2009 It might be more natural to shift the index by 1 and prefix a(0)=0, then this would be exactly the first differences of A000085, and satisfy a(n)=n for n<3, a(n)/n = a(n-1)/(n-1) - a(n-2). - M. F. Hasler, Dec 25 2010 REFERENCES rec.puzzles, Dec 10 1995 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..200 FORMULA E.g.f: (1+x+x^2)*exp((1+x/2)*x). - Benoit Cloitre, Apr 28 2005, corrected by Vaclav Kotesovec, Oct 07 2012 a(n) = A000085(n) * (n+1). a(n) = A000085(n+2) - A000085(n+1). - M. F. Hasler, Dec 26 2010 a(n) ~ n*exp(sqrt(n)-n/2-1/4)*n^(n/2)/sqrt(2). - Vaclav Kotesovec, Oct 07 2012 E.g.f. simplifies to x*exp(x + x^2/2) if offset is 1. - David Callan, Nov 11 2012 G.f.: T(0)/x^2 - 1/x^2, where T(k) = 1 - (k+1)*x^2/( (k+1)*x^2 - (1-x)^2/T(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Nov 03 2013 a(n) = (n+1) * (-i/sqrt(2))^n * H_n(i/sqrt(2)), where H_n(x) is the Hermite polynomial. - Vladimir Reshetnikov, Nov 12 2016 0 = a(n)*(+a(n+1) - 2*a(n+2) - 2*a(n+3) + a(n+4)) + a(n+1)*(+3*a(n+2) + a(n+3) - a(n+4)) + a(n+2)*(-2*a(n+2) + a(n+3)) for all n in Z. - Michael Somos, Nov 12 2016 a(n) = A099020(n+1,1). - R. J. Mathar, Jul 06 2023 EXAMPLE G.f. = 1 + 2*x + 6*x^2 + 16*x^3 + 50*x^4 + 156*x^5 + 532*x^6 + ... MAPLE A013989 := proc(n) option remember; if n <=1 then n+1; else (n+1)*(A013989(n-1)/n+A013989(n-2)); fi; end; MATHEMATICA Table[n!*SeriesCoefficient[(1+x+x^2)*E^((1+x/2)*x), {x, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, Oct 07 2012 *) Table[(n + 1) (-I/Sqrt[2])^n HermiteH[n, I/Sqrt[2]], {n, 0, 30}] (* Vladimir Reshetnikov, Nov 12 2016 *) PROG (PARI) x='x+O('x^66); Vec(serlaplace((1+x+x^2)*exp((1+x/2)*x))) \\ Joerg Arndt, May 04 2013 (PARI) {a(n) = if( n<0, 0, n! * polcoeff( (1 + x + x^2) * exp( x * (1 + x/2 + O(x^n))), n))}; /* Michael Somos, Nov 12 2016 */ CROSSREFS First differences of A000085 (except for a missing leading zero). Sequence in context: A195645 A000136 A369365 * A002841 A136509 A100664 Adjacent sequences: A013986 A013987 A013988 * A013990 A013991 A013992 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Dan Hoey, 1996 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.

Last modified August 15 17:35 EDT 2024. Contains 375173 sequences. (Running on oeis4.)