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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A073258 Numbers n such that gcd(c(n),n) = gcd(A002808(n),n) = A064814(n)=1 where c(n) is the n-th composite number. 1
 1, 3, 4, 8, 9, 11, 13, 17, 19, 23, 25, 27, 29, 31, 33, 35, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 49, 53, 57, 58, 59, 61, 66, 67, 68, 69, 71, 73, 79, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 94, 95, 97, 100, 101, 103, 106, 107, 108, 109, 111, 113, 115, 116, 117, 118, 119 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE n=256: composite(256) = 323 = 17*19, gcd(323,256)=1, so 256 is a term. MATHEMATICA c[x_] := FixedPoint[x+PrimePi[ # ]+1&, x]; t=Table[0, {256}]; s=0; k=0; Do[s=GCD[c[n], n]; If[Equal[s, 1], k=k+1; t[[k]]=n; Print[{k, n}]], {n, 1, 256}] t CROSSREFS Cf. A064814, A002808, A073257. Sequence in context: A050003 A002156 A285033 * A170954 A286750 A135135 Adjacent sequences:  A073255 A073256 A073257 * A073259 A073260 A073261 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 January 20 19:53 EST 2020. Contains 331096 sequences. (Running on oeis4.)