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 A079058 #10 Jul 29 2025 08:49:10 %S A079058 1,3,5,6,7,8,9,9,10,11,11,12,12,13,13,14,14,14,15,15,16,16,16,17,17, %T A079058 18,18,18,19,19,19,20,20,20,20,21,21,21,22,22,22,22,23,23,23,24,24,24, %U A079058 24,25,25,25,25,26,26,26,26,27,27,27,27,28,28,28,28,28,29,29,29,29,30,30 %N A079058 Least k > 0 such that A025591(k) >= p(n) (p(n)=the n-th partition number). %F A079058 a(n) is asymptotic to C*sqrt(n) with 3.5<C<3.6... Is it true that C = exp(Pi/sqrt(6))? %o A079058 (PARI) a(n)=if(n<0,0,k=1; while(polcoeff(prod(i=1,k,1+x^i),k*(k+1)\4)-polcoeff(1/eta(x),n)<0,k++); k) %Y A079058 Cf. A000041. %K A079058 nonn %O A079058 1,2 %A A079058 _Benoit Cloitre_, Feb 02 2003 %E A079058 Name corrected by _Sean A. Irvine_, Jul 28 2025