|
| |
| |
|
|
|
1, 1, 1, 1, 1, 1, 1, 5, 2, 2, 2, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 2, 3, 2, 2, 1, 4, 2, 3, 7, 2, 3, 1, 1, 1, 1, 21, 21, 2, 1, 1, 2, 6, 14, 3, 1, 2, 1, 1, 1, 1, 2, 1, 3, 4, 4, 17, 1, 2, 1, 2, 2, 4, 1, 3, 5, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 4, 1, 1, 1, 2, 11, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,8
|
|
|
LINKS
|
|
|
|
MAPLE
|
b:= proc(n) option remember; `if`(n=0, 1, add(b(n-j)*add(
`if`(d::odd, d, 0), d=numtheory[divisors](j)), j=1..n)/n)
end:
a:= n-> igcd(b(n), combinat[numbpart](n)):
|
|
|
MATHEMATICA
|
Table[GCD[PartitionsP[n], PartitionsQ[n]], {n, 0, 100}]
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
