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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A193496 a(n) = 1 iff digit n+1 of pi is >= digit n, otherwise a(n) = 0. We consider 3 to be digit 1 of pi. 3

%I

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

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

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

%N a(n) = 1 iff digit n+1 of pi is >= digit n, otherwise a(n) = 0. We consider 3 to be digit 1 of pi.

%C If A000796(n+1) >= A000796(n) then a(n)=1, else a(n)=0.

%C a(n) = if A095916(n) < 0 then 0 else 1. - _Reinhard Zumkeller_, Mar 12 2015

%H Reinhard Zumkeller, <a href="/A193496/b193496.txt">Table of n, a(n) for n = 1..1000</a>

%H <a href="/index/Ph#Pi314">Index entries for sequences related to the number Pi</a>

%e a(1) = 0 because A000796(2)=1 < A000796(1)=3.

%t nn = 100; d = RealDigits[N[Pi, nn]][[1]]; Table[Boole[d[[n + 1]] >= d[[n]]], {n, nn - 1}] (* _T. D. Noe_, Jul 29 2011 *)

%o (Haskell)

%o a193496 = fromEnum . (>= 0) . a095916 -- _Reinhard Zumkeller_, Mar 12 2015

%Y Cf. A000796.

%Y Cf. A095916, A030658.

%K nonn,base

%O 1

%A _Alexander R. Povolotsky_, Jul 28 2011

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 17:33 EST 2019. Contains 329960 sequences. (Running on oeis4.)