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