|
|
A082073
|
|
First difference set of primes with 4k+1 form: A002144.
|
|
10
|
|
|
8, 4, 12, 8, 4, 12, 8, 12, 16, 8, 4, 8, 4, 24, 12, 8, 16, 8, 12, 4, 32, 4, 8, 16, 12, 8, 4, 12, 20, 4, 20, 12, 4, 20, 16, 8, 4, 8, 12, 12, 16, 8, 4, 48, 12, 20, 16, 12, 8, 16, 8, 12, 4, 24, 12, 8, 12, 4, 24, 8, 24, 24, 4, 8, 4, 24, 12, 12, 8, 24, 4, 20, 4, 48, 8, 4, 12, 24, 20, 12, 4, 8, 12
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(n) is divisible by 4, for all n.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
first and second 4k+1 primes are 5 and 13, so a(1)=13-5=8;
|
|
MATHEMATICA
|
k=0; m=4; r=1; Do[s=Mod[Prime[n], m]; If[Equal[s, r], rp=ep; k=k+1; ep=Prime[n]; Print[(ep-rp)]; ], {n, 1, 1000}]
Differences[Select[Prime[Range[200]], Mod[#, 4]==1&]] (* Harvey P. Dale, Feb 05 2020 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|