Search: id:A062964
Results 1-1 of 1 results found.

%I A062964
%S A062964 3,2,4,3,15,6,10,8,8,8,5,10,3,0,8,13,3,1,3,1,9,8,10,2,14,0,3,7,0,7,3,4,
%T A062964 4,10,4,0,9,3,8,2,2,2,9,9,15,3,1,13,0,0,8,2,14,15,10,9,8,14,12,4,14,6,
%U A062964 12,8,9,4,5,2,8,2,1,14,6,3,8,13,0,1,3,7,7,11,14,5,4,6,6,12,15,3,4,14,9
%N A062964 Pi in hexadecimal.
%D A062964 S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 17-28.
%H A062964 Harry J. Smith, <a href="b062964.txt">Table of n, a(n) for n=1,...,20000</
               a>
%H A062964 S. R. Finch, <a href="http://algo.inria.fr/bsolve/constant/plouffe/plouffe.html">
               The Miraculous Bailey-Borwein-Plouffe Pi Algorithm</a>
%H A062964 Johnny Vogler, <a href="http://www.math.byu.edu/~jvogler/pi.html">More 
               digits</a>
%F A062964 a(n) = 8*A004601(4n)+4*A004601(4n+1)+2*A004601(4n+2)+1*A004601(4n+3).
%F A062964 If Pi is the expansion of Pi in base 10 Pi=3, 1415926...: a(n)=floor(16^n*Pi)-16*floor(16^(n-1)*Pi) 
               - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 09 2002
%t A062964 RealDigits[ N[ Pi, 115], 16] [[1]]
%o A062964 (PARI) { default(realprecision, 24300); x=Pi; for (n=1, 20000, d=floor(x); 
               x=(x-d)*16; write("b062964.txt", n, " ", d)); } [From Harry J. Smith 
               (hjsmithh(AT)sbcglobal.net), Apr 27 2009]
%Y A062964 Pi in various bases: A004601 to A004608, A000796, A068436 to A068440, 
               A062964. Cf. A007514.
%Y A062964 Sequence in context: A061721 A066257 A085591 this_sequence A010270 A023630 
               A110550
%Y A062964 Adjacent sequences: A062961 A062962 A062963 this_sequence A062965 A062966 
               A062967
%K A062964 easy,nonn,cons
%O A062964 1,1
%A A062964 Robert Lozyniak (11(AT)onna.com), Jul 22 2001
%E A062964 More terms from Henry Bottomley (se16(AT)btinternet.com), Jul 24 2001
%E A062964 Fixed my PARI program, had -n Harry J. Smith (hjsmithh(AT)sbcglobal.net), 
               May 19 2009

Search completed in 0.002 seconds