|
|
A366033
|
|
Successive digits of consecutive terms of the prime-counting function A000720.
|
|
1
|
|
|
0, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 3, 1, 4, 1, 4, 1, 4, 1, 4, 1, 5, 1, 5, 1, 5, 1, 5, 1, 5, 1, 5, 1, 6, 1, 6, 1, 6, 1, 6, 1, 6
(list;
constant;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
By analogy with the Copeland-Erdős constant 0.2357111317... given by concatenating the base-10 expansions of consecutive entries of the sequence of prime numbers, the so-called "prime-counting Copeland-Erdős constant" 0.0122...9101011... is defined similarly, but with the use of the prime-counting function in place of the prime number sequence.
|
|
LINKS
|
|
|
EXAMPLE
|
0.012233444455666677888899999910101111...
The prime-counting function evaluated at 1 is 0, so a(0) = 0, and the first digit after the decimal point of the prime-counting Copeland-Erdős constant is 0.
|
|
MATHEMATICA
|
Flatten[Table[IntegerDigits[PrimePi[n]], {n, 1, 57}]]
|
|
PROG
|
(PARI) concat(0, concat(vector(50, i, digits(primepi(i))))) \\ Michel Marcus, Nov 04 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|