Voozh

A073275

Smallest k such that remainder c(k) mod k = n, where c(k) = A002808(k) = k-th composite number or 0 if no such number exists.

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<=Length[t]&&t[[s]]==0, t[[s]]=n], {n, 1, 10000}]; t

CROSSREFS

Cf. A002808, A065860.

Sequence in context: A089331 A125856 A057110 * A309528 A293496 A290326