cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Keywords

Comments

a(n) = if A095916(n) <= 0 then 1 else 0. - Reinhard Zumkeller, Mar 12 2015

Crossrefs

Programs

  • Haskell
    a030658 = fromEnum . (<= 0) . a095916  -- Reinhard Zumkeller, Mar 12 2015
    
  • Mathematica
    If[First[#]>=Last[#],1,0]&/@Partition[RealDigits[Pi,10,130][[1]],2,1] (* Harvey P. Dale, Jul 25 2011 *)
  • Python
    import sympy as sp
    length = 100
    [int(x>=y) for l in [str(sp.N(sp.pi/10,length))[2:]] for x,y in zip(l[:-1],l[1:])]
    # Nicholas Stefan Georgescu, Feb 27 2023

Extensions

More terms from David Radcliffe