The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA Do[ PartitionsP[n], {n, 200000}]; f[n_] := Block[{k = 1}, While[ !PrimeQ[ PartitionsP[k*n]], k++ ]; k]; Array[f, 72] CROSSREFS Cf. A000041, A046063, A114165, A111389, A111045, A114166, A111036, A114167, A114168, A114169, A114170, A114171. Sequence in context: A127125 A256671 A327156 * A154243 A326698 A299432 Adjacent sequences:  A114168 A114169 A114170 * A114172 A114173 A114174 KEYWORD nonn AUTHOR Robert G. Wilson v, Nov 14 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 23 22:20 EDT 2021. Contains 346265 sequences. (Running on oeis4.)