|
| |
|
|
A147952
|
|
Modulo three recursion: f(n) = f(f(n - 2)) + If[Mod[n, 3] == 0, f(f(n/3)), If[Mod[n, 3] == 1, f(f((n - 1)/3)), f(n - f((n - 2)/3]))].
|
|
2
| |
|
|
0, 1, 1, 2, 2, 3, 2, 3, 4, 3, 3, 5, 3, 4, 5, 4, 5, 7, 4, 4, 6, 4, 4, 8, 4, 6, 6, 4, 4, 8, 4, 6, 10, 5, 6, 7, 4, 5, 9, 5, 5, 8, 6, 7, 7, 5, 5, 10, 6, 6, 7, 5, 6, 8, 4, 6, 8, 4, 6, 8, 4, 6, 10, 4, 5, 8, 5, 6, 8, 6, 8, 6, 6, 4, 10, 4, 5, 8, 5, 6, 13, 4, 6, 8, 4, 6, 8, 6, 8, 6, 6, 4, 10, 4, 5, 8, 6, 7, 10, 6, 6
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
FORMULA
| f(n) = f(f(n - 2)) + If[Mod[n, 3] == 0, f(f(n/3)), If[Mod[n, 3] == 1, f(f((n - 1)/3)), f(n - f((n - 2)/3]))].
|
|
|
MATHEMATICA
| f[0] = 0; f[1] = 1; f[2] = 1; f[n_] := f[n] = f[f[n - 2]] + If[Mod[n, 3] == 0, f[f[n/3]], If[Mod[n, 3] == 1, f[f[(n - 1)/3]], f[n - f[(n - 2)/3]]]]; Table[f[n], {n, 0, 100}]
|
|
|
CROSSREFS
| A147665
Sequence in context: A071647 A051125 A131830 * A091316 A071825 A115727
Adjacent sequences: A147949 A147950 A147951 * A147953 A147954 A147955
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 17 2008
|
| |
|
|
