|
Search: id:A082904
|
|
|
| A082904 |
|
Modified Pascal-triangle, read by rows. Restricted to C[n, j] binomial coefficients when j-s are divisors of n. So each row contains d[n] terms. |
|
+0
1
|
|
| 1, 2, 1, 3, 1, 4, 6, 1, 5, 1, 6, 15, 20, 1, 7, 1, 8, 28, 70, 1, 9, 84, 1, 10, 45, 252, 1, 11, 1, 12, 66, 220, 495, 924, 1, 13, 1, 14, 91, 3432, 1, 15, 455, 3003, 1, 16, 120, 1820, 12870, 1, 17, 1, 18, 153, 816, 18564, 48620, 1, 19, 1, 20, 190, 4845, 15504, 184756, 1, 21, 1330
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
n-th row of table consists of A000005[n] terms:
1,
2,1,
3,1,
4,6,1,
5,1,
6,15,20,1,
7,1,
8,28,70,1,
9,84,1,
10,45,252,1,
25th row = {C[25,1],C[25,5],C[25,25]}={25,53130,1}.
|
|
MATHEMATICA
|
Flatten[Table[Binomial[n, Divisors[n]], {n, 1, 25}], 1]
|
|
CROSSREFS
|
Cf. A000005, A007318, A056045.
Sequence in context: A098910 A142884 A142878 this_sequence A034868 A050382 A054072
Adjacent sequences: A082901 A082902 A082903 this_sequence A082905 A082906 A082907
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Apr 23 2003
|
|
|
Search completed in 0.002 seconds
|
