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!)
A347667 Triangle read by rows: T(n,k) = Sum_{j=0..k} binomial(n,j) * j! (0 <= k <= n). 0
1, 1, 2, 1, 3, 5, 1, 4, 10, 16, 1, 5, 17, 41, 65, 1, 6, 26, 86, 206, 326, 1, 7, 37, 157, 517, 1237, 1957, 1, 8, 50, 260, 1100, 3620, 8660, 13700, 1, 9, 65, 401, 2081, 8801, 28961, 69281, 109601, 1, 10, 82, 586, 3610, 18730, 79210, 260650, 623530, 986410 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
Triangle begins:
1;
1, 2;
1, 3, 5;
1, 4, 10, 16;
1, 5, 17, 41, 65;
1, 6, 26, 86, 206, 326;
1, 7, 37, 157, 517, 1237, 1957;
1, 8, 50, 260, 1100, 3620, 8660, 13700;
...
MATHEMATICA
T[n_, k_] := Sum[Binomial[n, j] j!, {j, 0, k}]; Table[T[n, k], {n, 0, 9}, {k, 0, n}] // Flatten
CROSSREFS
T(n,n) = A000522, T(2*n,n) = A066211.
Sequence in context: A210557 A118243 A210233 * A297582 A134081 A134247
KEYWORD
nonn,tabl
AUTHOR
Ilya Gutkovskiy, Sep 10 2021
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 August 14 10:54 EDT 2024. Contains 375159 sequences. (Running on oeis4.)