login
A257341
Solution to Popular Computing Problem 56 (binary).
3
1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0
OFFSET
0
COMMENTS
See link for precise definition.
LINKS
Popular Computing (Calabasas, CA), Solution to Problem 56, Vol. 4 (No. 39, June 1976), page PC39-3 [Annotated and scanned copy]
PROG
(Python)
from fractions import Fraction
A257341_list, m = [], 2
for i in range(2, 10):
for j in range(1, i):
x = Fraction(j, i)
if x.denominator == i:
A257341_list.append(int(m*x) % 2)
m *= 2 # Chai Wah Wu, Apr 29 2015
CROSSREFS
KEYWORD
nonn,cons,base
AUTHOR
N. J. A. Sloane, Apr 27 2015
EXTENSIONS
More terms from Chai Wah Wu, Apr 29 2015
STATUS
approved