|
Search: id:A000932
|
|
|
| A000932 |
|
a(n) = a(n-1) + n*a(n-2); a(0) = a(1) = 1.
(Formerly M2595 N1025)
|
|
+0
2
|
|
| 1, 1, 3, 6, 18, 48, 156, 492, 1740, 6168, 23568, 91416, 374232, 1562640, 6801888, 30241488, 139071696, 653176992, 3156467520, 15566830368, 78696180768, 405599618496, 2136915595392, 11465706820800, 62751681110208
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Contribution from Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 20 2009: (Start)
Uses the same recursive operation as A000085.
Eigensequence of an infinite lower triangular matrix with (1, 1, 1,...)
as the main diagonal and (0, 2, 3, 4, 5,...) as the subdiagonal.
To generate A000085, replace the "0" in the subdiagonal with "1". (End)
|
|
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).
|
|
FORMULA
|
a(n)/a(n-1) = sqrt(n)+1/2+o(1) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 02 2004
|
|
CROSSREFS
|
A000085 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 20 2009]
Sequence in context: A108507 A083337 A019308 this_sequence A161006 A148560 A148561
Adjacent sequences: A000929 A000930 A000931 this_sequence A000933 A000934 A000935
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 02 2004
|
|
|
Search completed in 0.002 seconds
|
