A087839 - OEIS

A087839

a(n) = a(a(a(a(a(n-2))))) + a(n - a(n-2)).

1, 1, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

A fifth-order recursion based on A005229.

Differs from A106742 at n = 233 where this is 23 whereas A106742(233) = 22. - Joshua Zucker, May 17 2007

LINKS

Table of n, a(n) for n=1..85.

MATHEMATICA

a[n_Integer?Positive] := a[n] = a[a[a[a[a[n-2]]]]]+ a[n - a[n-2]]

a[1] = a[2] = 1

Table[a[n], {n, 1, 100}]