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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064170 a(1) = 1; a(n+1) = product of numerator and denominator in sum{k = 1 to n} 1/a(k). 2
1, 1, 2, 10, 65, 442, 3026, 20737, 142130, 974170, 6677057, 45765226, 313679522, 2149991425, 14736260450, 101003831722, 692290561601, 4745030099482, 32522920134770, 222915410843905, 1527884955772562, 10472279279564026 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

The numerator and denominator in the definition have no common divisors >1.

For n >= 3, a(n) = Fibonacci(2*n-5)*Fibonacci(2*n-3). - Barry Cipra (bcipra(AT)rconnect.com), Jun 06 2002

Also denominators in a system of Egyptian fraction for ratios of consecutive Fibonacci numbers: 1/2 = 1/2, 3/5 = 1/2 + 1/10, 8/13 = 1/2 + 1/10 + 1/65, 21/34 = 1/2 + 1/10 + 1/65 + 1/442 etc. (Rossi and Tout). - Barry Cipra (bcipra(AT)rconnect.com), Jun 06 2002

a(n)-1 is a square. - Sture Sjöstedt, Nov 04 2011

REFERENCES

Rossi and Tout, Historia Mathematica, vol. 29 (2002), 101-113.

FORMULA

2/(1+sqrt5) = .6180339... = 1/2 + 1/10 + 1/65 + 1/442 + 1/3026...= Sum (3 through infinity) 1/a(n). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 07 2003

Conjecture: a(n)=8*a(n-1)-8*a(n-2)+a(n-3), n>4. G.f.: -x*(2*x^2+x^3-7*x+1)/((x-1)*(x^2-7*x+1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 03 2009]

EXAMPLE

1/a(1) + 1/a(2) + 1/a(3) + 1/a(4) = 1 + 1 + 1/2 + 1/10 = 13/5. So a(5) = 13 * 5 = 65.

CROSSREFS

Cf. A000045, A059929, A058038.

Cf. A033890 (first differences). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 03 2009]

Cf. A001906.

Sequence in context: A078531 A130721 A167449 * A151410 A027307 A060206

Adjacent sequences:  A064167 A064168 A064169 * A064171 A064172 A064173

KEYWORD

nonn

AUTHOR

Leroy Quet Sep 19 2001

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

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.