A272612 - OEIS

A272612

a(0)=1, a(1)=1; thereafter a(n) = a(n-A272611(n)) + a(n-A272611(n-1)).

1, 1, 2, 2, 2, 3, 3, 4, 3, 4, 5, 4, 5, 5, 5, 7, 5, 6, 8, 5, 7, 9, 6, 9, 8, 8, 8, 9, 11, 10, 9, 10, 10, 10, 10, 11, 11, 12, 15, 10, 12, 16, 10, 16, 12, 13, 15, 12, 15, 18, 13, 14, 15, 17, 14, 17, 15, 17, 19, 17, 15, 20, 20, 16, 19, 19, 19, 21, 19, 19, 20, 20, 20, 20

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

OFFSET

0,3

COMMENTS

Much like the Hofstadter Q-sequence A005185, it is not known if this sequence is defined for all positive n.

Empirically, this sequence appears to grow approximately like n/4 with a lot of noise.

a(n) exists for n<=10^7.

LINKS

Nathan Fox, Table of n, a(n) for n = 0..10000

MAPLE

See A272611 for Maple code

CROSSREFS