This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060733 a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 6) so far). 0
 1, 2, 3, 4, 5, 6, 11, 17, 28, 39, 50, 89, 139, 189, 239, 378, 428, 667, 906, 1284, 1712, 2618, 3046, 3952, 5664, 6948, 9994, 12612, 15658, 18276, 28270, 35218, 50876, 56540, 72198, 79146, 130022, 145680, 217878, 246148, 318346, 334004, 551882 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS MATHEMATICA m[ 1 ] = 1; m[ 2 ] = 2; m[ 3 ] = 3; m[ 4 ] = 4; m[ 5 ] = 5; m[ 6 ] = 6; m[ n_Integer ] := m[ n ] = Block[ {a = b = c = d = e = f = 0}, Do[ Switch[ Mod[ m[ k ], 6 ], 0, a++, 1, b++, 2, c++, 3, d++, 4, e++, 5, f++ ], {k, 1, n - 1} ]; Switch[ Mod[ n, 6 ], 0, m[ n - 1 ] + m[ n - 1 - a ], 1, m[ n - 1 ] + m[ n - 1 - b ], 2, m[ n - 1 ] + m[ n - 1 - c ], 3, m[ n - 1 ] + m[ n - 1 - d ], 4, m[ n - 1 ] + m[ n - 1 - e ], 5, m[ n - 1 ] + m[ n - 1 - f ] ] ]; Table[ m[ n ], {n, 1, 45} ] CROSSREFS Sequence in context: A308776 A264995 A319722 * A283563 A033078 A118598 Adjacent sequences:  A060730 A060731 A060732 * A060734 A060735 A060736 KEYWORD nonn AUTHOR Robert G. Wilson v, Apr 22 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 11 18:19 EST 2019. Contains 329925 sequences. (Running on oeis4.)