login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006676 Number of paths through an array.
(Formerly M4292)
0
6, 104, 1345, 16344, 200452, 2552192, 34138908, 482076000, 7196676696, 113548220928, 1891322394624, 33205209053184, 613390541616000, 11900521690398720, 242050276080034560, 5152173699467335680, 114574144611434273280 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=3..19.

A. M. Khidr and B. S. El-Desouky, A symmetric sum involving the Stirling numbers of the first kind, European J. Combin., 5 (1984), 51-54.

FORMULA

a(n) = - Sum_{k=3..n} binomial(k, 3) * s(n+1, n+1-k) * n^(n-k) where s(n, k) are Stirling numbers of the first kind. - Sean A. Irvine, Jun 16 2017

CROSSREFS

Sequence in context: A001526 A295940 A106304 * A006768 A055969 A285027

Adjacent sequences:  A006673 A006674 A006675 * A006677 A006678 A006679

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Sean A. Irvine, Jun 16 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 10:51 EDT 2019. Contains 328216 sequences. (Running on oeis4.)