Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135829
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135829 A Fibonacci-Fibonacci recursion: a(n) = F(n)*a(n-1) + a(n-2). +0
2
1, 1, 3, 10, 53, 434, 5695, 120029, 4086681, 224887484, 20019072757 (list; graph; listen)
OFFSET

1,3

FORMULA

Given a(1) = 1, then for n>1, a(n) = F(n)*a(n-1) + a(n-2).

EXAMPLE

a(5) = 53 = F(5)*a(4) + a(3) = 5*10 + 3.

CROSSREFS

Cf. A000045.

Sequence in context: A002873 A042171 A133148 this_sequence A071895 A054422 A074503

Adjacent sequences: A135826 A135827 A135828 this_sequence A135830 A135831 A135832

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 29 2007

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research