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.

A278068 Relative of Hofstadter Q-sequence: a(1) = 57, a(2) = 2; thereafter a(n) = a(n-a(n-1)) + a(n-a(n-2)).

This page as a plain text file.
%I A278068 #9 May 31 2024 05:48:14
%S A278068 57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,
%T A278068 2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,57,2,
%U A278068 57,2,57,59,2,116,2,116,2,116,2,116,2,116,2,116,2,116
%N A278068 Relative of Hofstadter Q-sequence: a(1) = 57, a(2) = 2; thereafter a(n) = a(n-a(n-1)) + a(n-a(n-2)).
%C A278068 In calculating terms of this sequence, use the convention that a(n)=0 for n<=0.
%C A278068 This sequence is eventually, beginning with a(3128), quasilinear with quasiperiod 1402.
%H A278068 Nathan Fox, <a href="/A278068/b278068.txt">Table of n, a(n) for n = 1..10000</a>
%H A278068 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.
%H A278068 Nathan Fox, <a href="/A278068/a278068.txt">Formula for a(n)</a>
%t A278068 a[1] = 57; a[2] = 2; a[n_] := a[n] = If[n < 1, 0, a[n-a[n-1]] + a[n-a[n-2]]];
%t A278068 Array[a, 100] (* _Paolo Xausa_, May 31 2024 *)
%Y A278068 Cf. A005185, A275163, A278066, A278067.
%K A278068 nonn
%O A278068 1,1
%A A278068 _Nathan Fox_, Nov 13 2016