|
Search: id: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, 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, 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
(list; cons; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 17-28.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,20000
S. R. Finch, The Miraculous Bailey-Borwein-Plouffe Pi Algorithm
Johnny Vogler, More digits
|
|
FORMULA
|
a(n) = 8*A004601(4n)+4*A004601(4n+1)+2*A004601(4n+2)+1*A004601(4n+3).
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
|
|
MATHEMATICA
|
RealDigits[ N[ Pi, 115], 16] [[1]]
|
|
PROGRAM
|
(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]
|
|
CROSSREFS
|
Pi in various bases: A004601 to A004608, A000796, A068436 to A068440, A062964. Cf. A007514.
Sequence in context: A061721 A066257 A085591 this_sequence A010270 A023630 A110550
Adjacent sequences: A062961 A062962 A062963 this_sequence A062965 A062966 A062967
|
|
KEYWORD
|
easy,nonn,cons
|
|
AUTHOR
|
Robert Lozyniak (11(AT)onna.com), Jul 22 2001
|
|
EXTENSIONS
|
More terms from Henry Bottomley (se16(AT)btinternet.com), Jul 24 2001
Fixed my PARI program, had -n Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 19 2009
|
|
|
Search completed in 0.002 seconds
|
