|
|
A179650
|
|
a(n) = (n-th prime) mod (n-th nonprime).
|
|
1
|
|
|
0, 3, 5, 7, 2, 3, 5, 5, 8, 13, 13, 17, 20, 21, 23, 3, 7, 7, 11, 11, 9, 13, 15, 19, 25, 25, 25, 27, 25, 25, 37, 39, 41, 41, 49, 49, 1, 1, 2, 5, 8, 7, 11, 7, 8, 7, 16, 25, 23, 22, 23, 23, 19, 26, 29, 32, 35, 31, 34, 35, 31, 38, 49, 50, 49, 47, 58, 61, 68, 67, 68, 71, 73, 76, 79, 77, 77
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
In the first 100000 terms, the integers {4, 36, 40, 54} are missing. - Robert G. Wilson v, Jul 23 2010
|
|
LINKS
|
|
|
EXAMPLE
|
For n=4, 7 mod 8 = 7.
|
|
MAPLE
|
|
|
MATHEMATICA
|
NonPrime[n_Integer] := FixedPoint[n + PrimePi@# &, n + PrimePi@n]; f[n_] := Mod[Prime@n, NonPrime@n]; Array[f, 70] (* Robert G. Wilson v, Jul 23 2010 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|