Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104204
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104204 If mod[n,3]=0 then a(n)=a(n-1); if mod[n,3]=1 then a(n)=a(n-2)+a(n-3); if mod[n,3]=2 then a(n)=a(n-3)+a(n-2)+a(n-3). +0
1
1, 1, 2, 3, 5, 4, 4, 9, 12, 12, 21, 25, 25, 46, 58, 58, 104, 129, 129, 233, 291, 291, 524, 653, 653, 1177, 1468, 1468, 2645, 3298, 3298, 5943, 7411, 7411, 13354, 16652, 16652, 30006, 37417, 37417, 67423, 84075, 84075, 151498, 188915, 188915, 340413, 424488 (list; graph; listen)
OFFSET

0,3

COMMENT

A sequentially switched sequence modulo 3.

FORMULA

a(n) = if mod[n, 3]=0 then a(n)=a(n-1) a(n) = if mod[n, 3]=1 then a(n)=a(n-2)+a(n-3) a(n) = if mod[n, 3]=2 then a(n)=a(n-3)+a(n-2)+a(n-3)

MATHEMATICA

a[n_Integer?Positive] := If[Mod[n, 3] == 0, a[n] = a[n - 1], If[Mod[n, 3] == 1, a[n] = a[n - 2] + a[n - 3], a[n] = a[n - 3] + a[n - 4] + a[n - 5]]] a[0] = 1; a[1] = 1; a[2] = 2; a[3] = 3; a[4] = 5; aa = Table[a[n], {n, 0, 200}]

CROSSREFS

Sequence in context: A123274 A023818 A102149 this_sequence A131296 A077664 A138311

Adjacent sequences: A104201 A104202 A104203 this_sequence A104205 A104206 A104207

KEYWORD

nonn

AUTHOR

R. L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 13 2005

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research