login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A283874 The Pierce expansion of the number Sum_{k>=1} 1/3^((2^k) - 1). 0
2, 3, 4, 9, 10, 81, 82, 6561, 6562, 43046721, 43046722, 1853020188851841, 1853020188851842, 3433683820292512484657849089281, 3433683820292512484657849089282, 11790184577738583171520872861412518665678211592275841109096961, 11790184577738583171520872861412518665678211592275841109096962 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

This sequence is the Pierce expansion of the number 3*s(3) - 1 = 0.370827687432918983346475478500709113969827799141493576... where s(u) = Sum_{k>=0) 1/u^(2^k) for u=3 has been considered by N. J. A. Sloane in A004200.

The continued fraction expansion of the number 3*s(3)-1 is essentially A081771.

LINKS

Table of n, a(n) for n=0..16.

Jeffrey Shallit, Simple continued fractions for some irrational numbers. J. Number Theory 11 (1979), no. 2, 209-217.

FORMULA

a(0) = 2, a(2k+1) = 3^(2^k), a(2k+2) = 3^(2^k) + 1, k >= 0.

EXAMPLE

The Pierce expansion of 0.3708276874329189833 starts as 1/2 - 1/(2*3) + 1/(2*3*4) - 1/(2*3*4*9) + 1/(2*3*4*9*10) - 1/(2*3*4*9*10*81) + ...

MAPLE

L:=[2]: for k from 0 to 6 do: L:=[op(L), 3^(2^k), 3^(2^k)+1]: od: print(L);

PROG

(PARI) a(n) = if (n==0, 2, if (n%2, 3^(2^((n-1)/2)), 3^(2^((n-2)/2))+1)); \\ Michel Marcus, Mar 31 2017

CROSSREFS

Sequence in context: A180743 A162662 A068334 * A263092 A118223 A212989

Adjacent sequences:  A283871 A283872 A283873 * A283875 A283876 A283877

KEYWORD

nonn

AUTHOR

Kutlwano Loeto, Mar 24 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 00:44 EDT 2018. Contains 316378 sequences. (Running on oeis4.)