Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071679
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071679 Least k such that the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4 ...., k/k equals n. +0
3
1, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169 (list; graph; listen)
OFFSET

1,2

FORMULA

Smallest k such that n = Max { 1<=i<=k: Card[ contfrac(k/i) ] } a(1)=1 and for n>1: a(n)=F(n+2) where F(n)=A000045(n) are the Fibonacci numbers.

G.f. : (1+x)^2/(1-x-x^2); a(n)=3F(n+1)-F(n-1)-0^n. - Paul Barry (pbarry(AT)wit.ie), Jul 26 2004

CROSSREFS

Sequence in context: A163685 A080614 A079122 this_sequence A020701 A024885 A133605

Adjacent sequences: A071676 A071677 A071678 this_sequence A071680 A071681 A071682

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 22 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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research