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!)
A357868 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (k*j)!* Stirling2(n,k*j). 2
1, 1, 0, 1, 1, 0, 1, 0, 3, 0, 1, 0, 2, 13, 0, 1, 0, 0, 6, 75, 0, 1, 0, 0, 6, 38, 541, 0, 1, 0, 0, 0, 36, 270, 4683, 0, 1, 0, 0, 0, 24, 150, 2342, 47293, 0, 1, 0, 0, 0, 0, 240, 1260, 23646, 545835, 0, 1, 0, 0, 0, 0, 120, 1560, 16926, 272918, 7087261, 0, 1, 0, 0, 0, 0, 0, 1800, 8400, 197316, 3543630, 102247563, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,9
LINKS
FORMULA
For k > 0, e.g.f. of column k: 1/(1 - (exp(x) - 1)^k).
T(0,k) = 1; T(n,k) = k! * Sum_{j=1..n} binomial(n,j) * Stirling2(j,k) * T(n-j,k).
EXAMPLE
Square array begins:
1, 1, 1, 1, 1, 1, ...
0, 1, 0, 0, 0, 0, ...
0, 3, 2, 0, 0, 0, ...
0, 13, 6, 6, 0, 0, ...
0, 75, 38, 36, 24, 0, ...
0, 541, 270, 150, 240, 120, ...
PROG
(PARI) T(n, k) = sum(j=0, n, (k*j)!*stirling(n, k*j, 2));
(PARI) T(n, k) = if(k==0, 0^n, n!*polcoef(1/(1-(exp(x+x*O(x^n))-1)^k), n));
CROSSREFS
Columns k=0-4 give: A000007, A000670, A052841, A353774, A353775.
Sequence in context: A351097 A155522 A007524 * A357881 A204689 A109718
KEYWORD
nonn,tabl
AUTHOR
Seiichi Manyama, Oct 17 2022
STATUS
approved

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 July 26 13:14 EDT 2024. Contains 374635 sequences. (Running on oeis4.)