OFFSET
0,1
COMMENTS
Related to a computer implementation of the sieve of Eratosthenes: Each positive odd number is represented by a bit: 0 if it is prime, 1 if it is composite. The term a(n) contains the 8 bits corresponding to the odd numbers from 16n+3 to 16n+17.
LINKS
Cino Hilliard, Program
EXAMPLE
In binary, a(0)=00010010, which means that among the odd numbers 3,5,7,9,11,13,15,17, only 9 and 15 are composite.
MATHEMATICA
a[n_] := Sum[2^(8-k)*If[PrimeQ[16n+2k+1], 0, 1], {k, 1, 8}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Cino Hilliard, Jan 21 2002
EXTENSIONS
Edited by Dean Hickerson, Feb 15 2002
STATUS
approved