Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091831
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091831 Pierce expansion of 1/sqrt(2). +0
1
1, 3, 8, 33, 35, 39201, 39203, 60245508192801, 60245508192803, 218662352649181293830957829984632156775201, 218662352649181293830957829984632156775203 (list; graph; listen)
OFFSET

0,2

COMMENT

If u(0)=exp(1/m) m integer>1 and u(n+1)=u(n)/frac(u(n)) then floor(u(n))=m*n

REFERENCES

P. Erdos and J. O. Shallit, New bounds on the length of finite Pierce and Engel series, Sem. Theor. Nombres Bordeaux (2) 3 (1991), no.1, 43-53.

LINKS

Author?, On a problem of Alfred Renyi

Vlado Keselj, Length of Finite Pierce Series: Theoretical Analysis and Numerical Computations .

J. O. Shallit, Some predictable Pierce expansions, Fib. Quart., 22 (1984), 332-335.

Eric Weisstein's World of Mathematics, Pierce Expansion

FORMULA

Let u(0)=sqrt(2) and u(n+1)=u(n)/frac(u(n)) where frac(x) is the fractional part of x, then a(n)=floor(u(n))

1/sqrt(2)= 1/a(1) - 1/a(1)/a(2) + 1/a(1)/a(2)/a(3) - 1/a(1)/a(2)/a(3)/a(4)...

limit n -> infty a(n)^(1/n)=e

PROGRAM

(PARI) r=sqrt(2); for(n=1, 10, r=r/(r-floor(r)); print1(floor(r), ", "))

CROSSREFS

Cf. A006275, A006276, A006283.

Cf. A006784 (Pierce expansion definition), A028254

Adjacent sequences: A091828 A091829 A091830 this_sequence A091832 A091833 A091834

Sequence in context: A094610 A064316 A009438 this_sequence A120892 A109655 A001120

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 09 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research