|
|
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
(list;
constant;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
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)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|