cp's OEIS Frontend

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.

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

This page as a plain text file.
%I A278064 #15 May 30 2024 16:58:39
%S A278064 1,2,3,4,5,6,7,8,9,10,11,12,3,13,14,5,15,6,7,16,18,10,8,18,22,12,19,
%T A278064 14,24,11,23,27,16,13,17,15,26,20,10,27,36,20,15,42,14,31,21,34,28,15,
%U A278064 23,50,14,31,54,24,19,23,42,32,31,34,51,14,36,61,29,17,77
%N A278064 Relative of Hofstadter Q-sequence: a(n) = n for 1 <= n <= 12; a(n) = a(n-a(n-1)) + a(n-a(n-2)) for n > 12.
%C A278064 Similar to Hofstadter's Q-sequence A005185 but with different starting values.
%C A278064 This sequence has exactly 69 terms, since a(69)=77 and computing a(70) would refer to a(-7).
%H A278064 Nathan Fox, <a href="/A278064/b278064.txt">Table of n, a(n) for n = 1..69</a>
%H A278064 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 A278064 a[n_] := a[n] = If[0 < n < 13, n, a[n-a[n-1]] + a[n-a[n-2]]];
%t A278064 Array[a, 69] (* _Paolo Xausa_, May 30 2024 *)
%Y A278064 Cf. A005185, A278056, A278057, A278058, A278059, A278060, A278061, A278062, A278063, A278065.
%K A278064 nonn,fini,full
%O A278064 1,2
%A A278064 _Nathan Fox_, Nov 10 2016