|
| |
|
|
A096197
|
|
a(n) = (1+prime(n)) mod n.
|
|
1
|
|
|
|
0, 0, 0, 0, 2, 2, 4, 4, 6, 0, 10, 2, 3, 2, 3, 6, 9, 8, 11, 12, 11, 14, 15, 18, 23, 24, 23, 24, 23, 24, 4, 4, 6, 4, 10, 8, 10, 12, 12, 14, 16, 14, 20, 18, 18, 16, 24, 32, 32, 30, 30, 32, 30, 36, 38, 40, 42, 40, 42, 42, 40, 46, 56, 56, 54, 54, 64, 66, 3, 0, 70, 0, 3, 4, 5, 4, 5, 8, 7, 10, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,5
|
|
|
COMMENTS
|
Graph is similar to that of A004648.
|
|
|
LINKS
|
|
|
|
MATHEMATICA
|
|
|
|
PROG
|
(PARI) lista(nn) = {forprime(p=2, n, print1((p+1) % primepi(p), ", "); ); } \\ Michel Marcus, Sep 11 2014
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
