cp's OEIS Frontend

A278062 Relative of Hofstadter Q-sequence: a(n) = n for 1 <= n <= 10; a(n) = a(n-a(n-1)) + a(n-a(n-2)) for n > 10.

%I A278062 #14 May 30 2024 06:56:25
%S A278062 1,2,3,4,5,6,7,8,9,10,3,11,12,5,13,6,7,14,16,10,8,16,20,12,17,14,22,
%T A278062 11,21,25,16,13,17,15,24,19,26,27,23,19,30,31,23,20,33,26,13,40,28,26,
%U A278062 37,27,20,37,38,30,38,21,35,40,22,35,41,41,24
%N A278062 Relative of Hofstadter Q-sequence: a(n) = n for 1 <= n <= 10; a(n) = a(n-a(n-1)) + a(n-a(n-2)) for n > 10.
%C A278062 Similar to Hofstadter's Q-sequence A005185 but with different starting values.
%C A278062 Much like the Hofstadter Q-sequence, it is not known if this sequence is defined for all positive n.
%C A278062 a(n) exists for n <= 3*10^7.
%H A278062 Nathan Fox, <a href="/A278062/b278062.txt">Table of n, a(n) for n = 1..10000</a>
%H A278062 Nathan Fox, <a href="https://vimeo.com/191094180">Hofstadter-like Sequences over Nonstandard Integers</a>, Talk given at the Rutgers Experimental Mathematics Seminar, November 10 2016.
%t A278062 a[n_] := a[n] = If[0 < n < 11, n, a[n-a[n-1]] + a[n-a[n-2]]];
%t A278062 Array[a, 100] (* _Paolo Xausa_, May 30 2024 *)
%Y A278062 Cf. A005185, A278056, A278057, A278058, A278059, A278060, A278061, A278063, A278064, A278065.
%K A278062 nonn
%O A278062 1,2
%A A278062 _Nathan Fox_, Nov 10 2016