|
|
A180933
|
|
Initial segments of A010051, interpreted as binary numbers, that are prime.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The main entry for this sequence is A124077.
The binary expansion of all terms of this sequence is some initial segment of 1101010001010001....
Next terms have 642, 1268, ... decimal digits.
Primes in an initial portion of the infinite binary string built from the prime characteristic function A010051. [From R. J. Mathar, Sep 26 2010]
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(2) = 13, which is 1101 in binary, corresponding to the characteristic sequence of the primes: 2 is prime, 3 is prime, 4 is composite, 5 is prime.
|
|
MAPLE
|
A072762 := proc(n) option remember; if n =1 then return 0; elif n =2 then return 1; end if; if isprime(n) then 2*procname(n-1)+1 ; else 2*procname(n-1) ; end if; end proc:
for n from 1 to 300 do p := A072762(n) ; if isprime(p) then printf("%d, ", p) ; end if; end do: (End)
|
|
PROG
|
(PARI) n=1; for(k=3, 1e4, n+=n+isprime(k); if(isprime(n), print1(n", ")
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|