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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073275 Smallest n such that remainder Mod[c(x),x]=n, where c(x) = A002808(x) = x-th composite number or 0 if no such number exists. 0
4, 3, 0, 0, 0, 0, 8, 10, 11, 14, 19, 20, 25, 28, 29, 32, 37, 42, 43, 48, 51, 52, 57, 60, 65, 72, 75, 76, 79, 80, 83, 96, 99, 104, 105, 114, 115, 120, 125, 128, 133, 138, 139, 148, 149, 152, 153, 164, 175, 178, 179, 182, 187, 188, 197, 202, 207, 212, 213, 218, 221 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..61.

FORMULA

a(n)=Min{x; A065860(x)=n}

MATHEMATICA

c[x_] := FixedPoint[x+primePi[ # ]+1&, x] t=Table[0, 100]; Do[s=Mod[c[n], n]]; If[s<101&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t

CROSSREFS

Cf. A002808, A065860.

Sequence in context: A089331 A125856 A057110 * A309528 A293496 A290326

Adjacent sequences:  A073272 A073273 A073274 * A073276 A073277 A073278

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 08:42 EST 2020. Contains 332221 sequences. (Running on oeis4.)