login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A006467
Continued fraction for Sum_{n>=0} (-1)^n/3^(2^n).
(Formerly M3206)
3
0, 4, 3, 1, 3, 5, 1, 3, 5, 3, 3, 1, 5, 3, 1, 3, 3, 5, 3, 1, 3, 5, 1, 3, 3, 5, 3, 1, 5, 3, 1, 3, 5, 3, 3, 1, 3, 5, 1, 3, 5, 3, 3, 1, 5, 3, 1, 3, 5, 3, 3, 1, 3, 5, 1, 3, 3, 5, 3, 1, 5, 3, 1, 3, 3, 5, 3, 1, 3, 5, 1, 3, 5, 3, 3, 1, 5, 3, 1, 3, 3, 5, 3, 1, 3, 5, 1, 3, 3, 5, 3, 1, 5, 3, 1, 3, 3, 5, 3, 1, 3, 5, 1, 3, 5
OFFSET
0,2
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
EXAMPLE
0.234415508674864614413415474... = 0 + 1/(4 + 1/(3 + 1/(1 + 1/(3 + ...)))). - Harry J. Smith, May 12 2009
MAPLE
u := 3: v := 7: Buv := [u, 1, [0, u+1, u-1]]: for k from 2 to v do n := nops(Buv[3]): Buv := [u, Buv[2]+1, [seq(Buv[3][i], i=1..n-1), Buv[3][n]-(-1)^Buv[2], Buv[3][n]+(-1)^Buv[2], seq(Buv[3][n-i], i=1..n-2)]] od:seq(Buv[3][i], i=1..2^v); # first 2^v terms of A006467 # Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Dec 02 2002
PROG
(PARI) { allocatemem(932245000); default(realprecision, 20000); x=suminf(n=0, (-1)^n/3^(2^n)); x=contfrac(x); for (n=1, 20001, write("b006467.txt", n-1, " ", x[n])); } \\ Harry J. Smith, May 12 2009
CROSSREFS
Cf. A160386 (decimal expansion). - Harry J. Smith, May 12 2009
Sequence in context: A123683 A010306 A197700 * A119505 A201518 A168616
KEYWORD
nonn,cofr
EXTENSIONS
Better description and more terms from Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Jun 19 2001
STATUS
approved