|
| |
| |
|
|
|
1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| No 2's appear.
|
|
|
MAPLE
| S[1]:={seq(i, i=1..10000)}: for n from 2 to 10000 do S[n]:=S[n-1] minus {seq(S[n-1][n*i], i=1..nops(S[n-1])/n)} od: A:=S[10000]: seq(A[j] mod 3, j=1..nops(A)); (Deutsch)
|
|
|
MATHEMATICA
| del[lst_, k_] := lst[[ Select[ Range[ Length[ lst]], Mod[ #, k] != 0 &]]]; For[ k = 2; s = Range[10000], k <= Length[s], k++, s = del[s, k]]; Mod[s, 3]
|
|
|
CROSSREFS
| Cf. A000960.
Sequence in context: A167364 A000480 A118251 * A175479 A120530 A078616
Adjacent sequences: A099073 A099074 A099075 * A099077 A099078 A099079
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com) and David Applegate (david(AT)research.att.com), Nov 15 2004
|
|
|
EXTENSIONS
| More terms from Robert G. Wilson v (rgwv(AT)rgwv.com) and Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 15 2004
|
| |
|
|
