Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052631
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052631 n!*Pell(n) (or n!*A000129(n)). +0
1
0, 1, 4, 30, 288, 3480, 50400, 851760, 16450560, 357436800, 8629286400, 229162348800, 6638962176000, 208362342988800, 7042436719718400, 255029193619200000, 9851119008546816000, 404305986955014144000, 17569457946995834880000, 805912049524456562688000 (list; graph; listen)
OFFSET

0,3

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 577

FORMULA

E.g.f.: -x/(-1+2*x+x^2)

Recurrence: {a(1)=1, a(0)=0, (-2-n^2-3*n)*a(n)+(-4-2*n)*a(n+1)+a(n+2)}

Sum(-1/4*(-1+_alpha)*_alpha^(-1-n), _alpha=RootOf(-1+2*_Z+_Z^2))*n!

MAPLE

spec := [S, {S=Prod(Z, Sequence(Union(Z, Z, Prod(Z, Z))))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);

with(combstruct):ZL:=[T, {T=Union(Z, Prod(Epsilon, Z, T), Prod(T, Z, Epsilon), Prod(T, Z, Z))}, labeled]:seq(count(ZL, size=i), i=0..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 16 2007

CROSSREFS

Sequence in context: A102307 A052658 A127130 this_sequence A167139 A054972 A052452

Adjacent sequences: A052628 A052629 A052630 this_sequence A052632 A052633 A052634

KEYWORD

easy,nonn

AUTHOR

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research