|
| |
|
|
A104120
|
|
(Prime(n + 1) - Prime(n))/2 (mod 2).
|
|
0
| |
|
|
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; 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 ?
|
|
|
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}]
|
|
|
CROSSREFS
| Cf. A028334.
Sequence in context: A105470 A087429 A093075 * A108336 A118268 A143220
Adjacent sequences: A104117 A104118 A104119 * A104121 A104122 A104123
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Mar 06 2005
|
| |
|
|
