A272613 - OEIS

A272613

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

1, 2, 2, 3, 4, 4, 5, 5, 6, 8, 6, 8, 9, 9, 13, 10, 12, 14, 11, 17, 17, 14, 17, 22, 16, 23, 17, 24, 22, 23, 23, 23, 26, 31, 28, 28, 35, 37, 32, 32, 39, 33, 39, 46, 34, 49, 33, 45, 48, 45, 46, 60, 54, 58, 56, 58, 50, 70, 54, 53, 73, 57, 61, 61, 77, 50, 73, 56, 68, 72

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

OFFSET

0,2

COMMENTS

This sequence exists as long as A272611 and A272612 exist.

Empirically, this sequence appears to grow approximately like n^a for some a between 1 and 2.

LINKS

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

MAPLE

See A272611 for Maple code

CROSSREFS

Cf. A005185, A272610, A272611, A272612.