|
Search: id:A060730
|
|
|
| A060730 |
|
a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 3) so far). |
|
+0
1
|
|
| 1, 2, 3, 5, 7, 12, 17, 22, 34, 41, 53, 87, 109, 131, 184, 218, 252, 361, 414, 501, 632, 763, 894, 1112, 1330, 1548, 1909, 2161, 2575, 3207, 3568, 4331, 5225, 5726, 6489, 7819, 8582, 9694, 11855, 12967, 14515, 18083, 19413, 21574, 26799, 28708, 32276
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(5) = a(4) + a(4 - the number of terms congruent to 2 (mod 3) so far) = a(4) + a(4-2) = 5 + 2 = 7.
|
|
MATHEMATICA
|
m[ 1 ] = 1; m[ 2 ] = 2; m[ 3 ] = 3; m[ n_Integer ] := m[ n ] = Block[ {a = b = c = 0}, Do[ Switch[ Mod[ m[ k ], 3 ], 0, a++, 1, b++, 2, c++ ], {k, 1, n - 1} ]; Switch[ Mod[ n, 3 ], 0, m[ n - 1 ] + m[ n - 1 - a ], 1, m[ n - 1 ] + m[ n - 1 - b ], 2, m[ n - 1 ] + m[ n - 1 - c ] ] ]; Table[ m[ n ], {n, 1, 50} ]
|
|
CROSSREFS
|
Adjacent sequences: A060727 A060728 A060729 this_sequence A060731 A060732 A060733
Sequence in context: A122622 A024790 A027959 this_sequence A123569 A048816 A080528
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 22 2001
|
|
|
Search completed in 0.002 seconds
|
