login
The OEIS is supported by the many generous donors 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

%I M4292 #14 Jun 16 2017 19:28:36

%S 6,104,1345,16344,200452,2552192,34138908,482076000,7196676696,

%T 113548220928,1891322394624,33205209053184,613390541616000,

%U 11900521690398720,242050276080034560,5152173699467335680,114574144611434273280

%N Number of paths through an array.

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

%H A. M. Khidr and B. S. El-Desouky, <a href="http://dx.doi.org/10.1016/S0195-6698(84)80018-9">A symmetric sum involving the Stirling numbers of the first kind</a>, European J. Combin., 5 (1984), 51-54.

%F 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

%K nonn

%O 3,1

%A _N. J. A. Sloane_.

%E More terms from _Sean A. Irvine_, Jun 16 2017

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)