The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A001345

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A001345

a(n) = Sum_{k = 0..3} (n+k)! C(3,k).
(history; published version)

#29 by Jon E. Schoenfield at Tue Feb 01 01:32:05 EST 2022

STATUS

editing

approved

#28 by Jon E. Schoenfield at Tue Feb 01 01:32:04 EST 2022

AUTHOR

N. J. A. Sloane.

STATUS

approved

editing

#27 by Bruno Berselli at Fri Jun 30 09:09:47 EDT 2017

STATUS

proposed

approved

#26 by Michel Marcus at Fri Jun 30 08:03:32 EDT 2017

STATUS

editing

proposed

#25 by Michel Marcus at Fri Jun 30 08:02:58 EDT 2017

CROSSREFS

Cf. A001346, A001347.

STATUS

approved

editing

#24 by Joerg Arndt at Fri Jun 30 08:02:38 EDT 2017

STATUS

proposed

approved

#23 by Michel Marcus at Fri Jun 30 07:59:28 EDT 2017

STATUS

editing

proposed

#22 by Michel Marcus at Fri Jun 30 07:59:18 EDT 2017

PROG

(PARI) a(n) = if (n == -1, 7, sum(k=0, 3, (n+k)!*binomial(3, k))); \\ _Michel Marcus_, Jun 30 2017

Discussion

Fri Jun 30

07:59

Michel Marcus: ref already in links

#21 by Michel Marcus at Fri Jun 30 07:58:40 EDT 2017

NAME

a(n) = Sum _{k = 0..3} (n+k)! C(3,k), k = 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.

PROG

(PARI) a(n) = if (n == -1, 7, sum(k=0, 3, (n+k)!*binomial(3, k)));

STATUS

approved

editing

#20 by N. J. A. Sloane at Mon Jun 15 22:42:25 EDT 2015

STATUS

editing

approved