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!)
A030658 1 iff n-th digit of Pi is >= (n+1)st digit. 3

%I #21 Feb 27 2023 11:15:18

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

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

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

%N 1 iff n-th digit of Pi is >= (n+1)st digit.

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

%H Reinhard Zumkeller, <a href="/A030658/b030658.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>

%t If[First[#]>=Last[#],1,0]&/@Partition[RealDigits[Pi,10,130][[1]],2,1] (* _Harvey P. Dale_, Jul 25 2011 *)

%o (Haskell)

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

%o (Python)

%o import sympy as sp

%o length = 100

%o [int(x>=y) for l in [str(sp.N(sp.pi/10,length))[2:]] for x,y in zip(l[:-1],l[1:])]

%o # _Nicholas Stefan Georgescu_, Feb 27 2023

%Y Cf. A095916, A193496, A000796.

%K nonn,base,easy,nice

%O 1,1

%A _Maghraoui Abdelkader_

%E More terms from _David Radcliffe_

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 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)