Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108282
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108282 a(n) = k*a(n-1) + a(n-2) where k = A003842(a); a(0) = 1. +0
1
1, 2, 3, 5, 13, 18, 49, 67, 116, 299, 415, 714, 1843, 2557, 6957, 9514, 16471, 42456, 58927, 160310, 219237, 379547, 978331, 1357878, 2336209, 6030296, 8366505, 22763306, 31129811, 53893117, 138916045, 192809162, 331725207, 856259576 (list; graph; listen)
OFFSET

0,2

COMMENT

Aperiodic recursive rabbit sequence.

The recursive Fibonacci-like multiplier k is derived from the rabbit sequence (1 0 1 1 0 1 0 1...) in which the 0's are replaced by 2's, getting the rabbit sequence of A003842: (1 2 1 1 2 1 2 1...).

EXAMPLE

a(6) = 49 = 2*18 + 13; where 2 = A003842(6)

CROSSREFS

Cf. A003842.

Sequence in context: A042261 A112596 A041385 this_sequence A042047 A087763 A104735

Adjacent sequences: A108279 A108280 A108281 this_sequence A108283 A108284 A108285

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), May 30 2005

EXTENSIONS

Corrected and extended by T. D. Noe (noe(AT)sspectra.com), Nov 02 2006

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