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 A032089 #16 Apr 01 2025 08:52:37
%S A032089 1,0,1,1,2,3,5,9,14,25,39,68,107,182,289,483,772,1275,2047,3355,5402,
%T A032089 8811,14213,23112,37325,60580,97905,158717,256622,415715,672337,
%U A032089 1088661,1760998,2850645,4611643,7463884,12075527,19541994,31617521,51163695,82781216,133951675
%N A032089 "BHK" (reversible, identity, unlabeled) transform of 1,0,1,0...(odds).
%H A032089 Andrew Howroyd, <a href="/A032089/b032089.txt">Table of n, a(n) for n = 1..1000</a>
%H A032089 Christian G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%H A032089 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (1,3,-2,-2,0,-1,1,1).
%F A032089 G.f.: x*(1-x-2*x^2+2*x^3+x^6)/((1-x)*(1+x)*(1-x-x^2)*(1-x^2-x^4)).
%F A032089 a(n) = a(n-1) + 3*a(n-2) - 2*a(n-3) - 2*a(n-4) - a(n-6) + a(n-7) + a(n-8) for n > 8. - _Andrew Howroyd_, Aug 31 2018
%F A032089 2*a(n) = 2*A000035(n) + A000045(n) - A053602(n). - _R. J. Mathar_, Mar 02 2022
%t A032089 LinearRecurrence[{1,3,-2,-2,0,-1,1,1},{1,0,1,1,2,3,5,9},42] (* _Stefano Spezia_, Apr 01 2025 *)
%o A032089 (PARI) Vec((1-x-2*x^2+2*x^3+x^6)/((1-x)*(1+x)*(1-x-x^2)*(1-x^2-x^4)) + O(x^40)) \\ _Andrew Howroyd_, Aug 31 2018
%K A032089 nonn,easy
%O A032089 1,5
%A A032089 _Christian G. Bower_