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 A278067 #8 May 30 2024 16:58:52 %S A278067 37,2,37,2,37,2,37,2,37,2,37,2,37,2,37,2,37,2,37,2,37,2,37,2,37,2,37, %T A278067 2,37,2,37,2,37,2,37,2,37,39,2,76,2,76,2,76,2,76,2,76,2,76,2,76,2,76, %U A278067 2,76,2,76,2,76,2,76,2,76,2,76,2,76,2,76,2,76,2,76,2,76,39 %N A278067 Relative of Hofstadter Q-sequence: a(1) = 37, a(2) = 2; thereafter a(n) = a(n-a(n-1)) + a(n-a(n-2)). %C A278067 In calculating terms of this sequence, use the convention that a(n)=0 for n<=0. %C A278067 This sequence has exactly 3850 terms, since a(3850)=0 and computing a(3851) would refer to itself. %C A278067 Superficially, this sequence behaves similarly to A278066. But, that sequence is infinite, but this sequence dies. %H A278067 Nathan Fox, <a href="/A278067/b278067.txt">Table of n, a(n) for n = 1..3850</a> %H A278067 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 A278067 a[1] = 37; a[2] = 2; a[n_] := a[n] = If[n < 1, 0, a[n-a[n-1]] + a[n-a[n-2]]]; %t A278067 Array[a, 100] (* _Paolo Xausa_, May 30 2024 *) %Y A278067 Cf. A005185, A278066, A278068. %K A278067 nonn,fini,full %O A278067 1,1 %A A278067 _Nathan Fox_, Nov 13 2016