login
This site is supported by donations to The OEIS Foundation.

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

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: A074201 A195053 A267136 * A284512 A267253 A261178

Adjacent sequences:  A257338 A257339 A257340 * A257342 A257343 A257344

KEYWORD

nonn,cons

AUTHOR

N. J. A. Sloane, Apr 27 2015

EXTENSIONS

More terms from Chai Wah Wu, Apr 29 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 17 07:59 EDT 2017. Contains 290635 sequences.