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 A377368 #12 Dec 30 2024 16:55:58
%S A377368 1,2,2,5,6,10,17,26,42,69,110,178,289,466,754,1221,1974,3194,5169,
%T A377368 8362,13530,21893,35422,57314,92737,150050,242786,392837,635622,
%U A377368 1028458,1664081,2692538,4356618,7049157,11405774,18454930,29860705,48315634,78176338
%N A377368 a(n) = A255978(n) + 1.
%H A377368 Paolo Xausa, <a href="/A377368/b377368.txt">Table of n, a(n) for n = 0..1000</a>
%H A377368 Daniel Hardisky, <a href="/A377368/a377368.png">Math Puzzle</a>, Short Mathematical Idea Facebook Group, Oct 19 2024.
%H A377368 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,-1,-1).
%F A377368 G.f.: (1+x-x^2-2*x^4) / ((1-x)*(1+x+x^2)*(1-x-x^2)).
%F A377368 a(n) = a(n-1) + a(n-2) + a(n-3) - a(n-4) - a(n-5) for n>4.
%t A377368 LinearRecurrence[{1, 1, 1, -1, -1}, {1, 2, 2, 5, 6}, 50] (* _Paolo Xausa_, Dec 30 2024 *)
%Y A377368 Cf. A255978.
%K A377368 nonn,easy
%O A377368 0,2
%A A377368 _Sean A. Irvine_, Dec 27 2024