The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A073257 Smallest n such that gcd(c(x),x) = gcd(A002808(x),x) = A064814(x) = n. 1
 1, 2, 12, 20, 5, 6, 7, 64, 234, 50, 55, 24, 26, 28, 30, 32, 629, 1008, 209, 220, 231, 1012, 506, 168, 425, 182, 189, 2716, 2204, 1080, 93, 96, 99, 2176, 105, 4428, 1369, 5586, 1755, 1800, 6109, 2478, 2279, 3916, 5760, 644, 4606, 1920, 1960, 10250, 2040, 2444 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = min{x: gcd(c(x), x)=n}, where c(x) is the x-th composite number. EXAMPLE 50th composite is 70, gcd(50,70)=10 appears first here, a(10)=50. MATHEMATICA f[x_] := FixedPoint[x+PrimePi[ # ]+1&, x] t=Table[0, {100}]; Do[s=GCD[f[n], n]; If[s<101&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t CROSSREFS Cf. A064814, A002808, A073258. Sequence in context: A216629 A337290 A259409 * A240905 A303880 A174977 Adjacent sequences:  A073254 A073255 A073256 * A073258 A073259 A073260 KEYWORD nonn AUTHOR Labos Elemer, Jul 22 2002 STATUS approved

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

Last modified May 7 20:36 EDT 2021. Contains 343652 sequences. (Running on oeis4.)