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 A091689 #24 May 16 2025 07:27:57 %S A091689 2,3,5,7,11,3718,386155,627,8349,2436,75175,34262962,14883,3010, %T A091689 526823,281589,386155,1064144451,124754,63261,105558,2552338241,4565, %U A091689 1958,75175,101,12132164,118114304,37274405776748077,1505499,37338,6185689,2323520,966467,90175434980549623 %N A091689 Smallest partition number with n-th prime as factor. %C A091689 Erdős conjectured that every prime divides at least one value of the partition function, see Ahlgren and Ono link. %H A091689 Amiram Eldar, <a href="/A091689/b091689.txt">Table of n, a(n) for n = 1..1000</a> %H A091689 Scott Ahlgren and Ken Ono, <a href="http://www.ams.org/notices/200109/fea-ahlgren.pdf">Addition and Counting: The Arithmetic of Partitions</a>, Notices of the AMS, 48 (2001) pp. 978-984. See p. 982. %H A091689 Gerard P. Michon, <a href="http://www.numericana.com/data/partition.htm">Table of partition function p(n) (n=0 through 4096)</a>. %H A091689 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PartitionFunctionPCongruences.html">Partition Function P Congruences</a>. %F A091689 a(n) = A000041(A091690(n)). %e A091689 For n = 10, A000040(10) = 29: a(10) = A000041(26) = 2436 = 29*7*3*2*2, as 29 does not divide smaller partition numbers. %Y A091689 Cf. A051143, A049575, A046063. %Y A091689 Cf. A000041, A091690. %K A091689 nonn %O A091689 1,1 %A A091689 _Reinhard Zumkeller_, Jan 29 2004 %E A091689 More terms from _Amiram Eldar_, May 16 2025