|
Search: id:A114022
|
|
|
| A114022 |
|
Self-describing sequence: a(n) gives the number of integers in the sequence which are < [a(n)]^2. |
|
+0
1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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: A125824 A038227 A080292 this_sequence A043048 A024574 A119203
Adjacent sequences: A114019 A114020 A114021 this_sequence A114023 A114024 A114025
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Feb 01 2006
|
|
|
Search completed in 0.002 seconds
|
