|
|
A114024
|
|
Self-describing sequence: a(n) gives the number of primes in the sequence which are strictly < [a(n)]^2.
|
|
1
|
|
|
0, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 48, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 75, 76, 77, 78, 80, 81
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
There are 0 primes < 0^2 (=0) in the whole sequence;
There are 2 primes < 2^2 (=4) -- they are "2" and "3");
There are 3 primes < 3^2 (=9) -- they are 2, 3 and 5;
There are 4 primes < 4^2 (=16) -- they are 2,3,5 and 7;
etc.
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|