[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087267 a(n) = gcd(n, pi(n)) where pi is A000720. 3
1, 1, 1, 2, 1, 3, 1, 4, 1, 2, 1, 1, 1, 2, 3, 2, 1, 1, 1, 4, 1, 2, 1, 3, 1, 1, 9, 1, 1, 10, 1, 1, 11, 1, 1, 1, 1, 2, 3, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 5, 3, 1, 1, 2, 1, 8, 1, 2, 1, 1, 1, 2, 9, 2, 1, 6, 1, 1, 1, 1, 1, 4, 1, 1, 3, 1, 7, 3, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 6, 1, 4, 3, 2, 1, 24, 1, 1, 1, 25, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
MATHEMATICA
Table[GCD[w, PrimePi[w]], {w, 1, 256}]
PROG
(PARI) a(n) = gcd(n, primepi(n)); \\ Michel Marcus, Apr 22 2018
CROSSREFS
Sequence in context: A305556 A177812 A280504 * A128267 A289508 A364448
KEYWORD
nonn
AUTHOR
Labos Elemer, Sep 16 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 09:16 EDT 2024. Contains 375511 sequences. (Running on oeis4.)