|
Search: id:A104205
|
|
|
| A104205 |
|
If mod[n,4]=0 then a(n)=a(n-1), if mod[n,4]=1 then a(n)=a(n-2)+a(n-3), if mod[n,4]=2 then a(n)=a(n-3)+a(n-4)+a(n-5), if mod[n,4]=2 then a(n)=a(n-4)+a(n-5)+a(n-6)+a[n-7]. |
|
+0
1
|
|
| 0, 1, 1, 2, 3, 5, 8, 4, 4, 12, 17, 20, 20, 37, 49, 53, 53, 102, 139, 159, 159, 298, 400, 453, 453, 853, 1151, 1310, 1310, 2461, 3314, 3767, 3767, 7081, 9542, 10852, 10852, 20394, 27475, 31242, 31242, 58717, 79111, 89963, 89963, 169074, 227791, 259033, 259033
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
MATHEMATICA
|
a[n_Integer?Positive] := If[Mod[n, 4] == 0, a[n] = a[n - 1], If[Mod[n, 4] == 1, a[n] = a[n - 2] + a[n - 3], If[Mod[n, 4] == 1, a[n] = a[n - 3] + a[n - 4] + a[ n - 5], a[n] = a[n - 4] + a[n - 5] + a[n - 6] + a[n - 7]]]] a[0] = 0; a[1] = 1; a[2] = 1; a[3] = 2; a[4] = 3; a[5] = 5; a[6] = 8 aa = Table[a[n], {n, 0, 200}]
|
|
CROSSREFS
|
Sequence in context: A030132 A130833 A004090 this_sequence A166015 A021428 A050196
Adjacent sequences: A104202 A104203 A104204 this_sequence A104206 A104207 A104208
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
R. L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 13 2005
|
|
|
Search completed in 0.002 seconds
|
