|
%I #20 Jul 19 2023 02:29:57
%S 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,
%T 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,
%U 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
%N a(n) = (n-th decimal digit of Pi) + 1.
%D GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See page 28.
%H G. C. Greubel, <a href="/A123152/b123152.txt">Table of n, a(n) for n = 1..20000</a>
%H Albert Frank, <a href="http://www.paulcooijmans.com/oth/intcont2003.html">International Contest Of Logical Sequences</a>, 2002 - 2003. Item 2.
%H Albert Frank, <a href="http://www.paulcooijmans.com/oth/intcont2003ans.html">Solutions of International Contest Of Logical Sequences</a>, 2002 - 2003.
%F a(n) = A000796(n) + 1. - _Michel Marcus_, Mar 01 2016
%t RealDigits[Pi,10,100][[1]]+1 (* _Harvey P. Dale_, Oct 11 2011 *)
%o (Magma)
%o pi:=Pi(RealField(130));
%o A000796:= Reverse(Intseq(Floor(10^110*pi))); // _Bruno Berselli_'s code
%o [1 +A000796[n]: n in [1..100]]; // _G. C. Greubel_, Jul 18 2023
%o (SageMath)
%o x=numerical_approx(pi, digits=130)
%o a=[1 + ZZ(i) for i in x.str(skip_zeroes=True) if i.isdigit()]
%o a[:120] # _G. C. Greubel_, Jul 18 2023
%Y Cf. A000796, A123153.
%K nonn,base
%O 1,1
%A Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 01 2006
|
