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!)
A269948 Triangle read by rows, Stirling set numbers of order 3, T(n,n) = 1, T(n,k) = 0 if k<0 or k>n, otherwise T(n,k) = T(n-1,k-1)+k^3*T(n-1, k), for n>=0 and 0<=k<=n. 3
1, 0, 1, 0, 1, 1, 0, 1, 9, 1, 0, 1, 73, 36, 1, 0, 1, 585, 1045, 100, 1, 0, 1, 4681, 28800, 7445, 225, 1, 0, 1, 37449, 782281, 505280, 35570, 441, 1, 0, 1, 299593, 21159036, 33120201, 4951530, 130826, 784, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,9
COMMENTS
Also called 3rd central factorial numbers.
LINKS
FORMULA
T(n,2) = (8^(n-1)-1)/7 for n>=1 (cf. A023001).
T(n,n-1) = (n*(n-1)/2)^2 for n>=1 (cf. A000537).
Row sums: A098437.
EXAMPLE
1,
0, 1,
0, 1, 1,
0, 1, 9, 1,
0, 1, 73, 36, 1,
0, 1, 585, 1045, 100, 1,
0, 1, 4681, 28800, 7445, 225, 1,
0, 1, 37449, 782281, 505280, 35570, 441, 1.
MAPLE
T := proc(n, k) option remember;
`if`(n=k, 1,
`if`(k<0 or k>n, 0,
T(n-1, k-1) + k^3*T(n-1, k))) end:
for n from 0 to 9 do seq(T(n, k), k=0..n) od;
MATHEMATICA
T[n_, n_] = 1; T[n_, k_] /; 0 <= k <= n := T[n, k] = T[n - 1, k - 1] + k^3*T[n - 1, k]; T[_, _] = 0;
Table[T[n, k], {n, 0, 8}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jul 25 2019 *)
CROSSREFS
Variant: A098436.
Cf. A007318 (order 0), A048993 (order 1), A269945 (order 2).
Sequence in context: A257097 A256667 A175764 * A121935 A070060 A329085
KEYWORD
nonn,tabl
AUTHOR
Peter Luschny, Mar 22 2016
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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)