|
Search: id:A005532
|
|
|
| A005532 |
|
Decimal expansion of fifth root of 3.
(Formerly M0953)
|
|
+0
2
|
|
| 1, 2, 4, 5, 7, 3, 0, 9, 3, 9, 6, 1, 5, 5, 1, 7, 3, 2, 5, 9, 6, 6, 6, 8, 0, 3, 3, 6, 6, 4, 0, 3, 0, 5, 0, 8, 0, 9, 3, 9, 3, 0, 9, 9, 9, 3, 0, 6, 8, 7, 7, 9, 8, 1, 1, 0, 4, 6, 1, 7, 3, 0, 1, 4, 3, 6, 0, 7, 4, 6, 6, 5, 3, 7, 7, 5, 4, 9, 3, 5, 6, 6, 6, 0, 5, 8, 9, 5, 1, 4, 4, 5, 8, 8, 1, 2, 3, 4, 2, 5, 6, 5, 9, 0, 2
(list; cons; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,20000
|
|
EXAMPLE
|
1.245730939615517325966680336640305080939309993068779811046173014360746... [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 12 2009]
|
|
MAPLE
|
Digits := 200: it := evalf(3^(1/5)/10, 200)-floor(evalf(3^(1/5)/10, 200)): for i from 1 to 150 do printf(`%d, `, floor(10*it)): it := 10*it-floor(10*it): od:
|
|
PROGRAM
|
(PARI) { default(realprecision, 20080); x=3^(1/5); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b005532.txt", n, " ", d)); } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 12 2009]
|
|
CROSSREFS
|
Cf. A003117 = Continued fraction. [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 12 2009]
Sequence in context: A098504 A137653 A021411 this_sequence A026202 A025511 A140203
Adjacent sequences: A005529 A005530 A005531 this_sequence A005533 A005534 A005535
|
|
KEYWORD
|
cons,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Feb 19 2001
Fixed my PARI program, had -n Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 19 2009
|
|
|
Search completed in 0.002 seconds
|
