|
|
A294389
|
|
a(n) = 2^(n-3) mod n, for n >= 3.
|
|
3
|
|
|
1, 2, 4, 2, 2, 0, 1, 8, 3, 8, 10, 4, 1, 0, 13, 8, 5, 12, 1, 6, 6, 8, 4, 20, 10, 16, 22, 8, 8, 0, 1, 26, 11, 8, 28, 10, 1, 32, 31, 8, 11, 24, 19, 12, 12, 32, 16, 28, 1, 28, 40, 44, 26, 32, 1, 44, 15, 32, 46, 16, 1, 0, 4, 8, 17, 36, 1, 58, 18, 8, 55, 56, 46, 40, 60, 8, 20, 32, 10, 62, 21, 8, 4, 22
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,2
|
|
COMMENTS
|
Every nonnegative integer seems to appear in the sequence, and every integer seems to appear in the sequence of first differences (see link).
|
|
LINKS
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Magma) [Modexp(2, (n-3), n): n in [3..100]]; // G. C. Greubel, Jan 11 2023
(SageMath) [power_mod(2, (n-3), n) for n in range(3, 101)] # G. C. Greubel, Jan 11 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|