|
Search: id:A001344
|
|
|
| A001344 |
|
Sum (n+k)! C(2,k), k = 0 . . 2.
(Formerly M1405 N0548)
|
|
+0
2
|
|
| 2, 5, 11, 38, 174, 984, 6600, 51120, 448560, 4394880, 47537280, 562464000, 7224940800, 100111334400, 1488257971200, 23625316915200, 398840682240000, 7134671351808000
(list; graph; listen)
|
|
|
OFFSET
|
-1,1
|
|
|
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
|
Sequence in context: A092298 A131581 A056301 this_sequence A056302 A065850 A106886
Adjacent sequences: A001341 A001342 A001343 this_sequence A001345 A001346 A001347
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
