Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122597
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122597 a(0) = 1, a(1) = 2, s = 1; for n >= 2, if a(n-1) is even and s = 0 then set a(n) = a(n-1)/2 and s = 1; otherwise set a(n) = a(n-1) + a(n-2) and s = 0. +0
2
1, 2, 3, 5, 8, 4, 12, 6, 18, 9, 27, 36, 18, 54, 27, 81, 108, 54, 162, 81, 243, 324, 162, 486, 243, 729, 972, 486, 1458, 729, 2187, 2916, 1458, 4374, 2187, 6561, 8748, 4374, 13122, 6561, 19683, 26244, 13122, 39366, 19683, 59049, 78732, 39366, 118098, 59049 (list; graph; listen)
OFFSET

0,2

FORMULA

For n >= 6, a(n) = A122164(n+5), so there is an explicit formula for the n-th term.

MAPLE

a:= n-> if n<=5 then [1, 2, 3, 5, 8, 4][n+1] else [2, 1, 3, 4, 2][modp(n+2, 5)+1] *3^iquo(n+2, 5) fi: seq (a(n), n=0..50); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 02 2008]

CROSSREFS

Cf. A000045, A122164, A000792.

Adjacent sequences: A122594 A122595 A122596 this_sequence A122598 A122599 A122600

Sequence in context: A104205 A021428 A050196 this_sequence A105836 A105822 A011158

KEYWORD

nonn

AUTHOR

njas, Aug 06 2008

EXTENSIONS

More terms from Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 02 2008

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 October 12 11:54 EDT 2008. Contains 144829 sequences.


AT&T Labs Research