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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152196 A sequence based on the digits of Log(10) as a BBP: a(k)=Floor[Mod[(1/2)*((-4)^k)*(6/(4*k + 1) - 3/(4*k + 3) - 1/(4*k + 4)), 3]]. 1

%I

%S 2,1,2,2,0,1,1,1,0,0,1,0,1,1,0,0,1,1,0,0,0,2,0,1,1,1,2,2,0,2,2,1,0,0,

%T 2,0,2,0,2,0,1,0,2,2,1,1,1,0,0,2,1,0,1,0,1,0,0,1,2,0,0,0,2,2,1,0,1,0,

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

%N A sequence based on the digits of Log(10) as a BBP: a(k)=Floor[Mod[(1/2)*((-4)^k)*(6/(4*k + 1) - 3/(4*k + 3) - 1/(4*k + 4)), 3]].

%H G. C. Greubel, <a href="/A152196/b152196.txt">Table of n, a(n) for n = 0..1000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BBP-TypeFormula.html">BBP-Type Formula</a>

%F a(k) = Floor[Mod[(1/2)*((-4)^k)*(6/(4*k + 1) - 3/(4*k + 3) - 1/(4*k + 4)), 3]].

%t Table[Floor[Mod[(1/2)*((-4)^k)*(6/(4*k + 1) - 3/(4*k + 3) - 1/(4*k + 4)), 3]], {k, 0, 100}]

%K nonn,base

%O 0,1

%A _Roger L. Bagula_ and _Alexander R. Povolotsky_, Nov 28 2008

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.

Last modified December 2 12:07 EST 2022. Contains 358493 sequences. (Running on oeis4.)