|
Search: id:A060743
|
|
|
| A060743 |
|
Least k such that GCD( p(k), q(k) ) is n, where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009). |
|
+0
2
|
|
| 1, 8, 26, 11, 7, 46, 33, 94, 277, 130, 85, 180, 173, 47, 434, 131, 60, 297, 1175, 569, 40, 305, 1243, 142, 1024, 213, 169, 775, 988, 900, 1622, 262, 470, 844, 812, 2391, 9480, 2607, 1624, 441, 1061, 2845, 1686, 501, 749, 109, 6958, 449, 572, 174, 178, 2887
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
Do[ d = GCD[ PartitionsP[ n ], PartitionsQ[ n ]]; If[ a[[ d ]] == 0, a[[ d ]] = n ], {n, 1, 10400} ]; Table[ a[[ n ]], {n, 1, 60} ]
|
|
CROSSREFS
|
Sequence in context: A042189 A004246 A060718 this_sequence A029617 A120743 A063560
Adjacent sequences: A060740 A060741 A060742 this_sequence A060744 A060745 A060746
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 23 2001
|
|
|
Search completed in 0.002 seconds
|
