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 A329227 #16 Jul 05 2021 16:46:12
%S A329227 0,0,0,0,0,1,1,2,4,6,12,20,35,63,108,192,336,588,1036,1813,3185,5590,
%T A329227 9804,17214,30200,53000,93015,163215,286440,502656,882096,1547992,
%U A329227 2716504,4767161,8365777,14680890,25763220,45211238,79340228,139232412,244335771
%N A329227 Products of consecutive terms of the Padovan sequence A000931.
%H A329227 Harvey P. Dale, <a href="/A329227/b329227.txt">Table of n, a(n) for n = 0..1000</a>
%F A329227 a(n) = A000931(n)*A000931(n+1).
%F A329227 a(n+2) = Sum_{i=0..n} A000931(i)*A000931(i+2).
%F A329227 a(n) - a(n-2) - a(n-3) - a(n-4) = A133037(n-2) + A133037(n-3) for n>3.
%F A329227 G.f.: x^5 / ((1 - 2*x + x^2 - x^3)*(1 + x - x^3)) (conjectured). - _Colin Barker_, Nov 08 2019
%e A329227 For n=5, a(5) = A000931(5)*A000931(6) = 1*1.
%t A329227 Times@@@Partition[LinearRecurrence[{0,1,1},{1,0,0},50],2,1] (* _Harvey P. Dale_, Jul 05 2021 *)
%o A329227 (Python)
%o A329227 p = lambda x:[1,0,0][x] if x<3 else p(x-2)+p(x-3)
%o A329227 a = lambda x:p(x)*p(x+1)
%Y A329227 Cf. A000931, A133037.
%K A329227 nonn
%O A329227 0,8
%A A329227 _David Nacin_, Nov 08 2019