login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081405 a(0)=a(1)=1; for n>1 a[n]=(n+1)*a(n-2) A001147 and A002866 are combed together. 4
1, 1, 3, 4, 15, 24, 105, 192, 945, 1920, 10395, 23040, 135135, 322560, 2027025, 5160960, 34459425, 92897280, 654729075, 1857945600, 13749310575, 40874803200, 316234143225, 980995276800, 7905853580625, 25505877196800, 213458046676875 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

a(0)=a(1)=1; a(2n)=A001147(2n-2) odd terms, double factorial numbers; a(2n-1)=A002866(n)=2^(n-1).n!

MAPLE

a[0]:=1:a[1]:=1:for n from 2 to 50 do a[n]:=(a[n-2]*(n+1)^2) od: seq(sqrt(a[n]), n=0..26); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 04 2008

MATHEMATICA

f[x_] := (x+1)*f[x-2]; f[0]=1; f[1]=1; Table[f[w], {w, 1, 30}]

CROSSREFS

Cf. A002866, A000142, A001147.

Sequence in context: A109926 A065942 A036759 * A167367 A024858 A135100

Adjacent sequences:  A081402 A081403 A081404 * A081406 A081407 A081408

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 01 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:30 EST 2012. Contains 205907 sequences.