A113886 Finite recursive sequence with a(n) = a(a(n-2)) + a(n-a(n-1)).

1, 1, 2, 2, 4, 3, 6, 3, 9, 3, 6, 5, 9, 7, 6, 6, 12, 9, 12, 6, 15, 12, 12, 14, 15, 12, 12, 15, 16, 13, 21, 13, 18, 13, 24, 12, 30, 12, 33, 15, 25, 18, 27, 24, 30, 21, 33, 18, 34, 18, 42, 15, 39, 12, 42, 16, 52, 15, 63

Offset: 0

Author

Josh Locker (joshlocker(AT)gmail.com), Jan 28 2006

Keywords

• easy
• fini
• full
• nonn

Programs

Mathematica

a[n_] := a[n] = a[a[n - 2]] + a[n - a[n - 1]] a[0] = a[1] = 1; Table[a[n], {n, 0, 58}]

Formula

a(n) = a(a(n-2)) + a(n-a(n-1)), a(0) = a(1) = 1.