|
|
A104120
|
|
(Prime(n + 1) - Prime(n))/2 (mod 2).
|
|
10
|
|
|
1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
Questions: Is s(n) = (1/n) Sum[a(i),{i,2,n+1)] > 1/2 for all n? Does s(n) --> 1/2 ?
|
|
LINKS
|
|
|
EXAMPLE
|
(Prime(2 + 1) - Prime(2)) (mod 2) = (5 - 3)/2 (mod 2) = 1 mod 2 = 1. So a(1) = 1.
|
|
MATHEMATICA
|
Table[Mod[(Prime[i + 1] - Prime[i])/2, 2], {i, 2, 100}]
Mod[(#[[2]]-#[[1]])/2, 2]&/@Partition[Prime[Range[2, 110]], 2, 1] (* Harvey P. Dale, Oct 01 2018 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|