The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099076 a(n) = A000960(n) mod 3. 0
 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; text; internal format)
 OFFSET 0,1 COMMENTS No 2's appear. LINKS 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)); # Emeric Deutsch, Nov 15 2004 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: A118251 A209198 A282343 * A282339 A175479 A307243 Adjacent sequences:  A099073 A099074 A099075 * A099077 A099078 A099079 KEYWORD nonn,easy AUTHOR N. J. A. Sloane and David Applegate, Nov 15 2004 EXTENSIONS More terms from Robert G. Wilson v and Emeric Deutsch, Nov 15 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 21 05:23 EST 2020. Contains 332086 sequences. (Running on oeis4.)