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 A346076 #10 Nov 28 2022 01:45:44
%S A346076 1,1,1,1,1,2,3,4,5,7,11,17,25,36,54,84,131,201,307,475,745,1172,1837,
%T A346076 2878,4531,7173,11381,18057,28669,45624,72796,116336,186066,297865,
%U A346076 477505,766621,1232214,1982292,3191693,5143974,8298640,13399691,21652705,35014373,56663700
%N A346076 a(n) = 1 + Sum_{k=1..n-4} a(k) * a(n-k-4).
%H A346076 G. C. Greubel, <a href="/A346076/b346076.txt">Table of n, a(n) for n = 0..1000</a>
%F A346076 G.f. A(x) satisfies: A(x) = 1 / (1 - x) + x^4 * A(x) * (A(x) - 1).
%t A346076 a[n_] := a[n] = 1 + Sum[a[k] a[n - k - 4], {k, 1, n - 4}]; Table[a[n], {n, 0, 44}]
%t A346076 nmax = 44; A[_] = 0; Do[A[x_] = 1/(1 - x) + x^4 A[x] (A[x] - 1) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
%o A346076 (SageMath)
%o A346076 @CachedFunction
%o A346076 def a(n): # a = A346076
%o A346076 if (n<5): return 1
%o A346076 else: return 1 + sum(a(k)*a(n-k-4) for k in range(1,n-3))
%o A346076 [a(n) for n in range(51)] # _G. C. Greubel_, Nov 27 2022
%Y A346076 Cf. A105633, A217282, A307971, A343305, A346048, A346073, A346075, A346077.
%K A346076 nonn
%O A346076 0,6
%A A346076 _Ilya Gutkovskiy_, Jul 04 2021