The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A235704 a(n) is the smallest number k such that n*k is a partition number. 1
1, 1, 1, 14, 1, 5, 1, 7, 15, 3, 1, 66, 286, 3, 1, 11, 22715, 44, 33, 35761, 2, 1, 363, 33, 63, 143, 5, 2, 84, 1, 2425, 72610, 7, 2725580, 11, 22, 926026, 3283, 123981330, 58088, 363, 1, 70, 4, 3, 176484, 11209, 85166, 10, 141790, 11209835405 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
a(n) = 1 iff n is a partition number.
LINKS
FORMULA
a(n) = A072871(n)/n.
EXAMPLE
For n = 4, a(4) = 14 because if 1<=k<=13 we have that 4*k is not a partition number, but if k = 14 then 4*14 = 56 and 56 is the number of partitions of 11.
MATHEMATICA
a[n_] := PartitionsP[NestWhile[(# + 1)&, 1, Mod[PartitionsP@ #, n] > 0 &]]/n; Array[a, 51] (* Giovanni Resta, Jan 15 2014 *)
CROSSREFS
Sequence in context: A040203 A040205 A171693 * A229199 A040206 A040207
KEYWORD
nonn
AUTHOR
Omar E. Pol, Jan 14 2014
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 19:25 EDT 2024. Contains 372494 sequences. (Running on oeis4.)