|
Search: id:A001345
|
|
|
| A001345 |
|
Sum (n+k)! C(3,k), k = 0 . . 3.
(Formerly M4352 N1822)
|
|
+0
2
|
|
| 7, 16, 49, 212, 1158, 7584, 57720, 499680, 4843440, 51932160, 610001280, 7787404800, 107336275200, 1588369305600, 25113574886400, 422465999155200
(list; graph; listen)
|
|
|
OFFSET
|
-1,1
|
|
|
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).
Biondi, E.; Divieti, L.; Guardabassi, G.; Counting paths, circuits, chains and cycles in graphs: A unified approach. Canad. J. Math. 22 1970 22-35.
|
|
CROSSREFS
|
Sequence in context: A154141 A152530 A065099 this_sequence A056613 A029498 A129422
Adjacent sequences: A001342 A001343 A001344 this_sequence A001346 A001347 A001348
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
