|
Search: id:A001338
|
|
|
| A001338 |
|
-1 + Sum (k-1)! C(n,k), k = 1 . . n.
(Formerly M1759 N0697)
|
|
+0
3
|
|
| 1, 0, 2, 7, 23, 88, 414, 2371, 16071, 125672, 1112082, 10976183, 119481295, 1421542640, 18348340126, 255323504931, 3809950977007, 60683990530224, 1027542662934914
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
Biondi, E.; Divieti, L.; Guardabassi, G.; Counting paths, circuits, chains and cycles in graphs: A unified approach. Canad. J. Math. 22 1970 22-35.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
CROSSREFS
|
Partial sums of A000522.
Equals A002104(n) + 1.
Sequence in context: A150338 A150339 A150340 this_sequence A150341 A150342 A124190
Adjacent sequences: A001335 A001336 A001337 this_sequence A001339 A001340 A001341
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
