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!)
A123152 a(n) = (n-th decimal digit of Pi) + 1. 2
4, 2, 5, 2, 6, 10, 3, 7, 6, 4, 6, 9, 10, 8, 10, 4, 3, 4, 9, 5, 7, 3, 7, 5, 4, 4, 9, 4, 3, 8, 10, 6, 1, 3, 9, 9, 5, 2, 10, 8, 2, 7, 10, 4, 10, 10, 4, 8, 6, 2, 1, 6, 9, 3, 1, 10, 8, 5, 10, 5, 5, 6, 10, 3, 4, 1, 8, 9, 2, 7, 5, 1, 7, 3, 9, 7, 3, 1, 9, 10, 10, 9, 7, 3, 9, 1, 4, 5, 9, 3, 6, 4, 5, 3, 2, 2, 8, 1, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See page 28.
LINKS
Albert Frank, International Contest Of Logical Sequences, 2002 - 2003. Item 2.
FORMULA
a(n) = A000796(n) + 1. - Michel Marcus, Mar 01 2016
MATHEMATICA
RealDigits[Pi, 10, 100][[1]]+1 (* Harvey P. Dale, Oct 11 2011 *)
PROG
(Magma)
pi:=Pi(RealField(130));
A000796:= Reverse(Intseq(Floor(10^110*pi))); // Bruno Berselli's code
[1 +A000796[n]: n in [1..100]]; // G. C. Greubel, Jul 18 2023
(SageMath)
x=numerical_approx(pi, digits=130)
a=[1 + ZZ(i) for i in x.str(skip_zeroes=True) if i.isdigit()]
a[:120] # G. C. Greubel, Jul 18 2023
CROSSREFS
Sequence in context: A211174 A367574 A059833 * A309567 A243855 A267185
KEYWORD
nonn,base
AUTHOR
Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 01 2006
STATUS
approved

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 March 19 04:58 EDT 2024. Contains 370952 sequences. (Running on oeis4.)