|
|
A359121
|
|
a(n) = number of terms of A068811 that are <= n.
|
|
4
|
|
|
0, 0, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
A068811 begins 3, 5, 7, ..., so the present sequence begins 0, 0, 1, 1, 2, 2, 3, ..., with an increment as each term of A068811 is reached.
|
|
MATHEMATICA
|
c = 0; Reap[Do[If[AllTrue[{n, 10^(1 + Floor@ Log10[n]) - n}, PrimeQ], c++]; Sow[c], {n, 86}]][[-1, -1]] (* Michael De Vlieger, Dec 18 2022 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|