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

%I #15 May 04 2016 08:33:51

%S 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,

%T 10,10,10,11,11,12,15,10,12,16,10,16,12,13,15,12,15,18,13,14,15,17,14,

%U 17,15,17,19,17,15,20,20,16,19,19,19,21,19,19,20,20,20,20

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

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

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

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

%H Nathan Fox, <a href="/A272612/b272612.txt">Table of n, a(n) for n = 0..10000</a>

%p See A272611 for Maple code

%Y Cf. A005185, A272610, A272611, A272613.

%K nonn

%O 0,3

%A _Nathan Fox_, May 03 2016