|
| |
|
|
A072608
|
|
Parity of remainder Mod[p(n),n]=A004648(n).
|
|
7
| |
|
|
0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
FORMULA
| a(n)=Mod[Mod[p(n), n], 2]=Mod[A004648(n), 2]
|
|
|
EXAMPLE
| n=25:p(25)=97,Mod[97,25]=22, a(25)=Mod[22,2]=0. With increasing n, a(n) alternates:...010101..,followed after by a range consisting only of 1-s. This secondary alternation also goes on.
|
|
|
MATHEMATICA
| mm[x_] := Mod[Mod[Prime[x], x], 2] Table[mm[w], {w, 1, 256}]
|
|
|
CROSSREFS
| Cf. A004648.
Sequence in context: A112690 A115971 A072165 * A171386 A125720 A095130
Adjacent sequences: A072605 A072606 A072607 * A072609 A072610 A072611
|
|
|
KEYWORD
| nice,nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Jun 24 2002
|
| |
|
|
