login
Solution to Popular Computing Problem 56 (binary).
3

%I #24 Sep 20 2024 23:53:38

%S 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,

%T 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,

%U 1,1,1,0,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0

%N Solution to Popular Computing Problem 56 (binary).

%C See link for precise definition.

%H Chai Wah Wu, <a href="/A257341/b257341.txt">Table of n, a(n) for n = 0..10000</a>

%H Popular Computing (Calabasas, CA), <a href="/A257341/a257341.png">Solution to Problem 56</a>, Vol. 4 (No. 39, June 1976), page PC39-3 [Annotated and scanned copy]

%o (Python)

%o from fractions import Fraction

%o A257341_list, m = [], 2

%o for i in range(2, 10):

%o for j in range(1, i):

%o x = Fraction(j, i)

%o if x.denominator == i:

%o A257341_list.append(int(m*x) % 2)

%o m *= 2 # _Chai Wah Wu_, Apr 29 2015

%Y Cf. A020652, A038567, A257342.

%K nonn,cons,base

%O 0

%A _N. J. A. Sloane_, Apr 27 2015

%E More terms from _Chai Wah Wu_, Apr 29 2015