|
|
A070446
|
|
a(n) = n^2 mod 24.
|
|
2
|
|
|
0, 1, 4, 9, 16, 1, 12, 1, 16, 9, 4, 1, 0, 1, 4, 9, 16, 1, 12, 1, 16, 9, 4, 1, 0, 1, 4, 9, 16, 1, 12, 1, 16, 9, 4, 1, 0, 1, 4, 9, 16, 1, 12, 1, 16, 9, 4, 1, 0, 1, 4, 9, 16, 1, 12, 1, 16, 9, 4, 1, 0, 1, 4, 9, 16, 1, 12, 1, 16, 9, 4, 1, 0, 1, 4, 9, 16, 1, 12, 1, 16, 9, 4, 1, 0, 1, 4, 9, 16, 1, 12, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
If a(n) = 1, then n is odd and is not divisible by 3.
For n <= 7919 and a(n)=1, approximately 37.8% of values of n are prime.
For n <= 104729, and a(n)=1, approximately 28.64% of values of n are prime.
(End)
|
|
LINKS
|
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
|
|
MATHEMATICA
|
PowerMod[Range[0, 100], 2, 24] (* or *) PadRight[{}, 100, {0, 1, 4, 9, 16, 1, 12, 1, 16, 9, 4, 1}] (* Harvey P. Dale, Jun 19 2014 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|