login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A114022
Self-describing sequence: a(n) gives the number of integers in the sequence which are < a(n)^2.
0
0, 1, 3, 9, 10, 11, 12, 13, 14, 81, 100, 121, 144, 169, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236
OFFSET
0,3
COMMENTS
Earliest strictly increasing sequence satisfying a(a(n))=a(n)^2. - Benoit Cloitre, May 26 2021
EXAMPLE
There are 0 integer in the sequence which are < 0^2; there is only 1 integer < 1^2 (this is "0", which is < 1); there are 3 integers < 3^2 (they are 0,1,3 which are < 9); there are 9 integers < 81 (0,1,3,9,10,11,12,13,14); etc.
CROSSREFS
Sequence in context: A080292 A273893 A228165 * A181862 A329560 A330296
KEYWORD
easy,nonn
AUTHOR
Eric Angelini, Feb 01 2006
STATUS
approved