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
Offset: 1
Keywords
Programs
-
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
Formula
a(n) = Min{x; A065860(x)=n}.