|
Search: id:A144064
|
|
|
| A144064 |
|
Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is Euler transform of (j->k). |
|
+0
21
|
|
| 1, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 5, 3, 0, 1, 4, 9, 10, 5, 0, 1, 5, 14, 22, 20, 7, 0, 1, 6, 20, 40, 51, 36, 11, 0, 1, 7, 27, 65, 105, 108, 65, 15, 0, 1, 8, 35, 98, 190, 252, 221, 110, 22, 0, 1, 9, 44, 140, 315, 506, 574, 429, 185, 30, 0, 1, 10, 54, 192, 490, 918, 1265, 1240, 810
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
COMMENT
|
A(n,k) is also the number of partitions of n into parts of k kinds.
|
|
LINKS
|
N. J. A. Sloane, Transforms
Index entries for expansions of Product_{k >= 1} (1-x^k)^m
|
|
FORMULA
|
G.f. of column k: Product_{j=1..inf} 1/(1-x^j)^k.
|
|
EXAMPLE
|
Square array begins:
1 1 1 1 1 1 ...
0 1 2 3 4 5 ...
0 2 5 9 14 20 ...
0 3 10 22 40 65 ...
0 5 20 51 105 190 ...
0 7 36 108 252 506 ...
|
|
MAPLE
|
with (numtheory): etr:= proc(p) local b; b:=proc(n) option remember; `if`(n=0, 1, add (add (d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n) end end: A:= (n, k)-> etr(j->k)(n); seq (seq (A(n, d-n), n=0..d), d=0..14);
|
|
CROSSREFS
|
Columns 0-24 give: A000007, A000041, A000712, A000716, A023003, A023004, A023005, A023006, A023007, A023008, A023009, A023010, A005758, A023011, A023012, A023013, A023014, A023015, A023016, A023017, A023018, A023019, A023020, A023021, A006922. Rows 0-2 give: A000012, A001477, A000096. Diagonal gives: A008485.
Sequence in context: A124394 A086460 A136431 this_sequence A130020 A091063 A085388
Adjacent sequences: A144061 A144062 A144063 this_sequence A144065 A144066 A144067
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 09 2008
|
|
|
Search completed in 0.002 seconds
|
