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 A328943 #16 May 22 2025 10:21:48
%S A328943 2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,
%T A328943 4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,
%U A328943 2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3,4,5,2,3
%N A328943 a(n) = 2 + (n mod 4).
%C A328943 Terms of the simple continued fraction of (36+sqrt(1806))/34.
%C A328943 2345/9999=0.234523452345...
%C A328943 Partial sums are given by A130482(n) + 2*n + 2.
%C A328943 Example of a sequence where the largest of any four consecutive terms equals the sum of the two smallest.
%H A328943 Michael De Vlieger, <a href="/A328943/b328943.txt">Table of n, a(n) for n = 0..10000</a>
%H A328943 David Nacin, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL26/Nacin/nacin5.html">Van der Laan Sequences and a Conjecture on Padovan Numbers</a>, J. Int. Seq., Vol. 26 (2023), Article 23.1.2.
%H A328943 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 1).
%F A328943 a(n) = 2 + (n mod 4).
%F A328943 G.f.: (5x^3 + 4x^2 + 3x + 2)/(1 - x^4).
%F A328943 a(n) = A010873(n) + 2 = A010883(n) + 1.
%F A328943 a(n) = 14 - a(n-1) - a(n-2) - a(n-3) for n > 2.
%t A328943 PadRight[{}, 120, {2, 3, 4, 5}]
%o A328943 (Python)
%o A328943 def a(n):
%o A328943 return n%4+2
%Y A328943 Cf. A010883, A010873, A130482
%K A328943 nonn
%O A328943 0,1
%A A328943 _David Nacin_, Oct 31 2019