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 A346077 #9 Nov 28 2022 01:45:41
%S A346077 1,1,1,1,1,1,2,3,4,5,6,8,12,18,26,36,49,69,101,150,221,320,460,667,
%T A346077 981,1456,2161,3191,4698,6932,10283,15324,22870,34103,50813,75770,
%U A346077 113229,169590,254340,381579,572537,859511,1291681,1943489,2926980,4410709,6649220,10028570
%N A346077 a(n) = 1 + Sum_{k=1..n-5} a(k) * a(n-k-5).
%H A346077 G. C. Greubel, <a href="/A346077/b346077.txt">Table of n, a(n) for n = 0..1000</a>
%F A346077 G.f. A(x) satisfies: A(x) = 1 / (1 - x) + x^5 * A(x) * (A(x) - 1).
%t A346077 a[n_] := a[n] = 1 + Sum[a[k] a[n - k - 5], {k, 1, n - 5}]; Table[a[n], {n, 0, 47}]
%t A346077 nmax = 47; A[_] = 0; Do[A[x_] = 1/(1 - x) + x^5 A[x] (A[x] - 1) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
%o A346077 (SageMath)
%o A346077 @CachedFunction
%o A346077 def a(n): # a = A346077
%o A346077 if (n<6): return 1
%o A346077 else: return 1 + sum(a(k)*a(n-k-5) for k in range(1,n-4))
%o A346077 [a(n) for n in range(51)] # _G. C. Greubel_, Nov 27 2022
%Y A346077 Cf. A105633, A217282, A307972, A346049, A346074, A346075, A346076.
%K A346077 nonn
%O A346077 0,7
%A A346077 _Ilya Gutkovskiy_, Jul 04 2021