Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071112
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071112 Smallest k such that the number of elements in the continued fraction for (1+1/k)^k is >= n. +0
1
1, 2, 3, 3, 3, 4, 4, 6, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 15, 15, 17, 17, 17, 17, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 23, 23, 23, 23, 23, 23, 23, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28 (list; graph; listen)
OFFSET

1,2

PROGRAM

(PARI) s=1; for(n=1, 160, while(length(contfrac((1+1/s)^s))<n, s++); print1(s, ", "))

CROSSREFS

Sequence in context: A156250 A029108 A134841 this_sequence A097087 A153161 A004525

Adjacent sequences: A071109 A071110 A071111 this_sequence A071113 A071114 A071115

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 27 2002

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research