This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A278059 #17 May 30 2024 03:04:52 %S A278059 1,2,3,4,5,6,7,3,8,9,5,10,6,7,11,13,10,8,13,17,7,16,20,7,13,19,10,16, %T A278059 19,12,23,25,12,24,25,15,26,30,14,28,16,26,20,15,25,30,26,24,33,29,24, %U A278059 36,29,21,43,31,26,35,19,29,51,17,40,33,38,28 %N A278059 Relative of Hofstadter Q-sequence: a(n) = n for 1 <= n <= 7; a(n) = a(n-a(n-1)) + a(n-a(n-2)) for n > 7. %C A278059 Similar to Hofstadter's Q-sequence A005185 but with different starting values. %C A278059 Much like the Hofstadter Q-sequence, it is not known if this sequence is defined for all positive n. %C A278059 a(n) exists for n <= 3*10^7. %H A278059 Nathan Fox, <a href="/A278059/b278059.txt">Table of n, a(n) for n = 1..10000</a> %H A278059 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 A278059 a[n_] := a[n] = If[0 < n < 8, n, a[n-a[n-1]] + a[n-a[n-2]]]; %t A278059 Array[a, 100] (* _Paolo Xausa_, May 29 2024 *) %Y A278059 Cf. A005185, A278056, A278057, A278058, A278060, A278061, A278062, A278063, A278064, A278065. %K A278059 nonn %O A278059 1,2 %A A278059 _Nathan Fox_, Nov 10 2016