|
Search: id:A001475
|
|
|
| A001475 |
|
a(n) = a(n-1) + n a(n-2).
(Formerly M1449 N0573)
|
|
+0
3
|
|
| 1, 2, 5, 13, 38, 116, 382, 1310, 4748, 17848, 70076, 284252, 1195240, 5174768, 23103368, 105899656, 498656912, 2404850720, 11879332048, 59976346448
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) = number of partitions of [n] in which the block containing 1 is of length <= 3 and all other blocks are of length <= 2. Example: a(4)=13 counts all 15 partitions of [4] except 1234 and 1/234. - David Callan (callan(AT)stat.wisc.edu), Jul 22 2008
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 86 (divided by 2).
|
|
FORMULA
|
E.g.f.: 1/2*(1+x)*exp(x+1/2*x^2)-1/2. - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 04 2003
|
|
CROSSREFS
|
Equals (1/2) A000085(n+1). Cf. A001189, A013989.
Adjacent sequences: A001472 A001473 A001474 this_sequence A001476 A001477 A001478
Sequence in context: A064384 A148302 A149857 this_sequence A149858 A148303 A148304
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
