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 A038752 #15 Feb 15 2021 22:51:50 %S A038752 1,1,2,3,6,11,5,56,9,22,12,7,42,14,101,526823,17,231,19,385,21,627,30, %T A038752 24,1255,26,1958,28,3010,31,1002,4565,33,8349,35,12310,37,17977,39, %U A038752 26015,41,37338,77,44,63261,46,89134,48,124754,50,173525,52,239943,54 %N A038752 Earliest sequence where a(a(n))=number of partitions of n. %C A038752 From _Georg Fischer_, Feb 11 2021: (Start) %C A038752 An algorithm may try to estimate terms a(n) = m for m = 0, 1, 2, ... as follows: %C A038752 - for m <= n the partition property must be satisfied, %C A038752 - m = n+1 must be accepted as the "earliest" new member, %C A038752 - for any m > n (estimated or computed), a(m) can immediately be computed by a(m)=a(a(n))=p(n). (End) %H A038752 <a href="/index/Aa#aan">Index entries for sequences of the a(a(n)) = 2n family</a> %e A038752 a(5)=a(a(6))=11. %Y A038752 Cf. A000041. %K A038752 nonn %O A038752 0,3 %A A038752 _Henry Bottomley_, May 03 2000 %E A038752 a(15) corrected by _Georg Fischer_, Feb 15 2021