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 A356620 #12 Sep 07 2022 12:27:18
%S A356620 0,1,4,11,26,56,115,230,453,884,1716,3321,6416,12383,23886,46060,
%T A356620 88803,171194,330009,636136,1226216,2363633,4556076,8782147,16928162,
%U A356620 32630112,62896595,121237118,233692093,450456028,868281948,1673667305,3226097496,6218502903
%N A356620 a(n) = number of k-tuples (u(1), u(2), ..., u(k)) with 1 <= u(1) < u(2) < ... < u(k) <= n such that u(i) - u(i-1) <= 4 for i = 2,...,k.
%H A356620 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,0,0,-1,1).
%F A356620 G.f.: (x (-1 - x - x^2 - x^3))/((-1 + x)^2 (-1 + x + x^2 + x^3 + x^4)).
%F A356620 a(n) = 3*a(n-1) - 2*a(n-2) - a(n-5) + a(n-6).
%t A356620 maxDiff = 4; t = Map[Length[Select[Map[{#, Max[Differences[#]]} &,
%t A356620 Drop[Subsets[Range[#]], # + 1]], #[[2]] <= maxDiff &]] &, Range[18]]
%Y A356620 Cf. A001891, A356619, A356621.
%K A356620 nonn,easy
%O A356620 0,3
%A A356620 _Clark Kimberling_, Sep 04 2022