|
|
A319299
|
|
Irregular triangle where T(n,k) is the number of integer partitions of n with GCD equal to the k-th divisor of n.
|
|
2
|
|
|
1, 1, 1, 2, 1, 3, 1, 1, 6, 1, 7, 2, 1, 1, 14, 1, 17, 3, 1, 1, 27, 2, 1, 34, 6, 1, 1, 55, 1, 63, 7, 3, 2, 1, 1, 100, 1, 119, 14, 1, 1, 167, 6, 2, 1, 209, 17, 3, 1, 1, 296, 1, 347, 27, 7, 2, 1, 1, 489, 1, 582, 34, 6, 3, 1, 1, 775, 14, 2, 1, 945, 55, 1, 1, 1254
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins:
1
1 1
2 1
3 1 1
6 1
7 2 1 1
14 1
17 3 1 1
27 2 1
34 6 1 1
55 1
63 7 3 2 1 1
100 1
119 14 1 1
167 6 2 1
209 17 3 1 1
296 1
347 27 7 2 1 1
489 1
582 34 6 3 1 1
|
|
MAPLE
|
# with table A000837 obtained from that sequence
f:= proc(n) local D, d;
D:= sort(convert(numtheory:-divisors(n), list), `>`);
end proc:
|
|
MATHEMATICA
|
Table[Length[Select[IntegerPartitions[n], GCD@@#==k&]], {n, 20}, {k, Divisors[n]}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|