OFFSET
0,3
COMMENTS
From Georg Fischer, Feb 11 2021: (Start)
An algorithm may try to estimate terms a(n) = m for m = 0, 1, 2, ... as follows:
- for m <= n the partition property must be satisfied,
- m = n+1 must be accepted as the "earliest" new member,
- for any m > n (estimated or computed), a(m) can immediately be computed by a(m)=a(a(n))=p(n). (End)
EXAMPLE
a(5)=a(a(6))=11.
CROSSREFS
KEYWORD
nonn
AUTHOR
Henry Bottomley, May 03 2000
EXTENSIONS
a(15) corrected by Georg Fischer, Feb 15 2021
STATUS
approved