The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A087271 Least number x such that gcd(x, pi(x)) = n. 0
1, 4, 6, 8, 50, 66, 77, 56, 27, 30, 33, 156, 169, 182, 465, 224, 238, 252, 2299, 1380, 189, 902, 207, 96, 100, 1872, 1323, 2464, 1247, 120, 1333, 3168, 528, 1258, 1295, 828, 3441, 2888, 1755, 5800, 1271, 1932, 731, 748, 765, 2852, 2209, 11568, 2695, 4000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Min{x; gcd(x, A000720(x))=n}.
EXAMPLE
n=253: a(253)=91586, pi(91586)=8855,
gcd(91586, 8855) = 253 first time.
MATHEMATICA
f[x_] := GCD[x, PrimePi[x]]; t=Table[0, {257}]; Do[s=f[n]; If[s<258&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t
Module[{tbl=Table[{x, GCD[x, PrimePi[x]]}, {x, 12000}]}, Table[SelectFirst[ tbl, #[[2]]==n&], {n, 50}]][[All, 1]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Feb 12 2020 *)
CROSSREFS
Sequence in context: A137026 A090938 A058229 * A067797 A203633 A190630
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 May 14 01:33 EDT 2024. Contains 372528 sequences. (Running on oeis4.)