login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257342 Solution to Popular Computing Problem 56 (decimal). 2

%I #22 Jan 07 2022 11:11:49

%S 8,8,9,0,0,0,3,5,4,9,6,9,5,2,3,0,1,3,9,3,4,6,7,1,9,6,9,0,8,7,9,1,2,9,

%T 3,1,0,5,3,8,4,8,0,2,1,0,1,7,9,5,4,3,4,1,4,5,4,3,4,6,5,3,7,0,0,3,2,3,

%U 9,6,3,5,0,8,5,2,5,3,1,2,8,6,1,1,0,9,8

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

%C See link for precise definition. This is the constant in A257341 written in base 10.

%H Chai Wah Wu, <a href="/A257342/b257342.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]

%e 0.88900035496952301393467196908791293...

%o (Python)

%o from fractions import Fraction

%o from math import log10

%o A257342_list, m, y = [], 2, Fraction(0,1)

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

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

%o x = Fraction(j,i)

%o if x.denominator == i:

%o y += Fraction(int(m*x) % 2,m)

%o m *= 2

%o for i in range(int(log10(m))-2):

%o y *= 10

%o A257342_list.append(int(y) % 10) # _Chai Wah Wu_, Apr 29 2015

%Y Cf. A020652, A038567, A257341.

%K nonn,cons

%O 0,1

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

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)