|
Search: id:A005000
|
|
|
| A005000 |
|
Define polynomials g_n by g_0=1, g_1=g_2=0, g_3=g_4=g_5=x; g(n) = x*Sum_{i=0..n-3} binomial(n-1,i)*g_i; then a(n) = g_n(1).
(Formerly M4788)
|
|
+0
6
|
|
| 1, 0, 0, 1, 1, 1, 11, 36, 92, 491, 2557, 11353, 60105, 362506, 2169246, 13580815, 91927435, 650078097, 4762023647, 36508923530, 292117087090, 2424048335917, 20847410586719, 185754044235873, 1711253808769653, 16272637428430152, 159561718111166776
(list; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
J. Riordan, A budget of rhyme scheme counts, pp. 455 - 465 of Second International Conference on Combinatorial Mathematics, New York, April 4-7, 1978. Edited by Allan Gewirtz and Louis V. Quintas. Annals New York Academy of Sciences, 319, 1979.
|
|
LINKS
|
J. Riordan, Cached copy of paper
|
|
MAPLE
|
g:=proc(n) option remember; if n=0 then RETURN(1); fi; if n<=2 then RETURN(0); fi; if n<=5 then RETURN(x); fi; expand(x*add(binomial(n-1, i)*g(i), i=0..n-3)); end;
[seq(subs(x=1, g(n)), n=0..60)];
|
|
CROSSREFS
|
Sequence in context: A160483 A034309 A006505 this_sequence A004637 A052526 A054293
Adjacent sequences: A004997 A004998 A004999 this_sequence A005001 A005002 A005003
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Entry revised by N. J. A. Sloane (njas(AT)research.att.com), Jul 27 2008
|
|
|
Search completed in 0.002 seconds
|
