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 A168092 #8 Jun 29 2023 12:47:02 %S A168092 2,3,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, %T A168092 5,5,5,5,5,5,5,5,5,5,5,5,5 %N A168092 a(n) = number of natural numbers m such that n - 2 <= m <= n + 2. %C A168092 Generalization: If a(n,k) = number of natural numbers m such that n - k <= m <= n + k (k >= 1) then a(n,k) = a(n-1,k) + 1 = n + k for 0 <= n <= k, a(n,k) = a(n-1,k) = 2k + 1 for n >= k + 1 (see, e.g., A158799). a(n) = (2 + n) for 0 <= n <= 2, a(n) = 5 for n >= 3. %H A168092 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1). %F A168092 G.f.: (2+x+x^2+x^3)/(1-x) = 1/(1-x)+(1-x^4)/(1-x)^2. - _Jaume Oliver Lafont_, Nov 29 2009 %Y A168092 Cf. A158411. - _Jaume Oliver Lafont_, Nov 29 2009 %K A168092 nonn %O A168092 0,1 %A A168092 _Jaroslav Krizek_, Nov 18 2009