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 A329011 #5 Dec 07 2019 01:43:47
%S A329011 1,2,7,26,521,434,13021,8138,36169,813802,8138021,3390842,203450521,
%T A329011 508626302,1695421007,1589457194,127156575521,35321270978,
%U A329011 3178914388021,3973642985026,26490953233507,198682149251302,1986821492513021,413921144273546,49670537312825521
%N A329011 a(n) = p(0,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(5) as in A327322.
%C A329011 a(n) is a strong divisibility sequence; i.e., gcd(a(h),a(k)) = a(gcd(h,k)).
%e A329011 See Example in A327322.
%t A329011 c[poly_] := If[Head[poly] === Times, Times @@ DeleteCases[(#1 (Boole[MemberQ[#1, x] || MemberQ[#1, y] || MemberQ[#1, z]] &) /@Variables /@ #1 &)[List @@ poly], 0], poly];
%t A329011 r = Sqrt[5]; f[x_, n_] := c[Factor[Expand[(r x + r)^n - (r x - 1/r)^n]]];
%t A329011 Flatten[Table[CoefficientList[f[x, n], x], {n, 1, 12}]]; (* A327322 *)
%t A329011 Table[f[x, n] /. x -> 0, {n, 1, 30}] (* A329011 *)
%t A329011 Table[f[x, n] /. x -> 1, {n, 1, 30}] (* A329012 *)
%t A329011 Table[f[x, n] /. x -> 2, {n, 1, 30}] (* A329013 *)
%t A329011 (* _Peter J. C. Moses_, Nov 01 2019 *)
%Y A329011 Cf. A327320, A327321, A329012, A329013.
%K A329011 nonn,easy
%O A329011 1,2
%A A329011 _Clark Kimberling_, Nov 23 2019