|
Search: id:A006675
|
|
|
| A006675 |
|
Number of paths through an array.
(Formerly M2079)
|
|
+0
6
|
|
| 0, 0, 2, 15, 104, 770, 6264, 56196, 554112, 5973264, 69998400, 886897440, 12089295360, 176484597120, 2748022986240, 45472329504000, 796983880089600, 14751208762214400, 287543058350284800
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
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.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..100
|
|
FORMULA
|
a(n) = n*n! * (H[ n ] - 1), H[ n ] = sum[ k=1..n ] k^-1.
E.g.f. A(x) = x*(1-x)^-2 * (-log(1-x))
|
|
EXAMPLE
|
x*(1-x)^-2 * (-log(1-x)) = x^2 + 5/2*x^3 + 13/3*x^4 + 77/12*x^5 + ...
|
|
CROSSREFS
|
Cf. A000254, A001705.
Sequence in context: A037641 A027080 A081018 this_sequence A037524 A037733 A037556
Adjacent sequences: A006672 A006673 A006674 this_sequence A006676 A006677 A006678
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Joe Keane (jgk(AT)jgk.org)
|
|
|
Search completed in 0.002 seconds
|
