|
| |
|
|
A067017
|
|
Start with a(0)=1, a(1)=4, a(2)=3, a(3)=2; for n>=3, a(n+1) = mex_i (a(i)+a(n-i)), where mex means smallest nonnegative missing number.
|
|
2
| |
|
|
1, 4, 3, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
