This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A235704 #21 May 08 2025 02:24:58 %S A235704 1,1,1,14,1,5,1,7,15,3,1,66,286,3,1,11,22715,44,33,35761,2,1,363,33, %T A235704 63,143,5,2,84,1,2425,72610,7,2725580,11,22,926026,3283,123981330, %U A235704 58088,363,1,70,4,3,176484,11209,85166,10,141790,11209835405 %N A235704 a(n) is the smallest number k such that n*k is a partition number. %H A235704 Amiram Eldar, <a href="/A235704/b235704.txt">Table of n, a(n) for n = 1..10000</a> %F A235704 a(n) = 1 iff n is a partition number. %F A235704 a(n) = A072871(n)/n. %e A235704 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. %t A235704 a[n_] := PartitionsP[NestWhile[(# + 1)&, 1, Mod[PartitionsP@ #, n] > 0 &]]/n; Array[a,51] (* _Giovanni Resta_, Jan 15 2014 *) %Y A235704 Cf. A000041, A046641, A072871, A213179, A213365, A216258, A217725, A217726, A222175, A222178, A222179, A225317, A225361. %K A235704 nonn %O A235704 1,4 %A A235704 _Omar E. Pol_, Jan 14 2014