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 A078109 #12 Jun 16 2025 20:16:33
%S A078109 3,10,38,10,35,66,19,150,90,30,243,159,138,270,19,186,35,178,358,127,
%T A078109 46,334,123,370,438,343,182,430,46,454,470,534,30,618,734,903,570,302,
%U A078109 571,638,30,166,822,647,426,998,75,106,606,322,82,210,1798,330,506
%N A078109 Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)) and M(k) = Max_{1<=i<=k} u(i), then for any k >= a(n), M(k) = floor(sqrt(k + A078108(n))).
%C A078109 Conjecture : a(n) always exists, a(n)/n^2 is bounded. If initial conditions are u(1)=u(2)=1, u(3)=2n+1, then u(k) reaches a 2-cycle for any k>m large enough (cf. A078098)
%Y A078109 Cf. A000196, A078108, A077623.
%K A078109 nonn
%O A078109 1,1
%A A078109 _Benoit Cloitre_, Dec 05 2002
%E A078109 Typos in data corrected and more terms from _Sean A. Irvine_, Jun 16 2025