login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A087266
a(n) = gcd(2^n, pi(2^n)) = gcd(A000079(n), A007053(n)).
5
1, 2, 4, 2, 1, 2, 1, 2, 1, 4, 1, 4, 4, 4, 8, 2, 1, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 1, 1, 2, 1, 1, 1, 4, 4, 2, 4, 4, 1, 1, 4, 2, 1, 1, 2, 2, 1, 8, 1, 4, 16, 1, 2, 4, 2, 4, 2, 1, 1, 8, 1, 4, 1, 1, 2, 16, 1, 1, 1, 1, 4, 1, 1, 4, 8, 1, 4, 4, 8, 4, 4, 2, 1, 1, 2, 4, 8, 16, 2
OFFSET
1,2
MATHEMATICA
Table[GCD[2^n, PrimePi[2^n]], {n, 40}] (* Michael De Vlieger, Mar 25 2017 *)
PROG
(PARI) a(n) = gcd(2^n, primepi(2^n)); \\ Michel Marcus, Mar 26 2017
CROSSREFS
Sequence in context: A342060 A302828 A321622 * A160801 A177002 A079046
KEYWORD
nonn
AUTHOR
Labos Elemer, Sep 16 2003
EXTENSIONS
a(53)-a(92) from Amiram Eldar, Jun 09 2024
STATUS
approved