A257341 Solution to Popular Computing Problem 56 (binary).

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

Chai Wah Wu, Table of n, a(n) for n = 0..10000

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

Cf. A020652, A038567, A257342.

Sequence in context: A115360 A088911 A179763 * A284512 A267253 A261178

Adjacent sequences: A257338 A257339 A257340 * A257342 A257343 A257344

Keyword

nonn,cons,base

Author

N. J. A. Sloane, Apr 27 2015

Extensions

More terms from Chai Wah Wu, Apr 29 2015

Status

approved