login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A114171
Least number m, a multiple of n, such that P(m*n) is prime, where P(k) is the number of partitions of k.
1
2, 1, 1, 1, 1, 1, 11, 21, 4, 44, 7, 3, 1, 12, 35, 81, 1429, 2, 132, 22, 8, 6, 154, 7, 21, 21, 8, 6, 29, 434, 6, 91, 4, 900, 15, 1, 126, 66, 14, 11, 122, 4, 477, 3, 481, 77, 4, 27, 15, 612, 600, 56, 4, 4, 8, 3, 44, 71, 310, 217, 6, 3, 74, 132, 333, 2, 1146, 450, 1655, 186, 58, 3
OFFSET
1,1
MATHEMATICA
Do[ PartitionsP[n], {n, 200000}]; f[n_] := Block[{k = 1}, While[ !PrimeQ[ PartitionsP[k*n]], k++ ]; k]; Array[f, 72]
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Nov 14 2005
STATUS
approved