|
Search: id:A000904
|
|
|
| A000904 |
|
a(n) = (n + 1) a(n - 1) + (n + 2) a(n - 2) + a(n - 3); a(1)=0, a(2)=3, a(3)=13.
(Formerly M2955 N1193)
|
|
+0
1
|
|
| 0, 3, 13, 83, 592, 4821, 43979, 444613, 4934720, 59661255, 780531033, 10987095719, 165586966816, 2660378564777, 45392022568023, 819716784789193, 15620010933562688, 313219935456042955, 6593238655510464741
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Menage numbers.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..100
E. Lucas, Th\'{e}orie des Nombres. Gauthier-Villars, Paris, 1891, Vol. 1, p. 495.
|
|
FORMULA
|
G.f.: 1/(x+x^2)^2*Sum_{n>=0} n!*(x/(1+x)^2)^n. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 29 2007
|
|
CROSSREFS
|
Sequence in context: A089461 A000684 A057993 this_sequence A135743 A123114 A104032
Adjacent sequences: A000901 A000902 A000903 this_sequence A000905 A000906 A000907
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Nov 27 2001
|
|
|
Search completed in 0.002 seconds
|
