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 A290990 #18 Apr 13 2023 02:34:24 %S A290990 0,1,2,5,12,28,64,145,328,743,1686,3830,8704,19781,44950,102133, %T A290990 232048,527208,1197808,2721421,6183108,14048151,31917714,72517738, %U A290990 164761792,374342057,850512458,1932380869,4390407092,9975090996,22663602720,51492150953 %N A290990 p-INVERT of the nonnegative integers (A000027), where p(S) = 1 - S - S^2. %C A290990 Suppose s = (c(0), c(1), c(2), ...) is a sequence and p(S) is a polynomial. Let S(x) = c(0)*x + c(1)*x^2 + c(2)*x^3 + ... and T(x) = (-p(0) + 1/p(S(x)))/x. The p-INVERT of s is the sequence t(s) of coefficients in the Maclaurin series for T(x). Taking p(S) = 1 - S gives the "INVERT" transform of s, so that p-INVERT is a generalization of the "INVERT" transform (e.g., A033453). %C A290990 See A290890 for a guide to related sequences. %H A290990 Clark Kimberling, <a href="/A290990/b290990.txt">Table of n, a(n) for n = 0..1000</a> %H A290990 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-5,2,1). %F A290990 a(n) = 4*a(n-1) - 5*a(n-2) + 2*a(n-3) + a(n-4). %F A290990 G.f.: x*(1 - 2*x + 2*x^2) / (1 - 4*x + 5*x^2 - 2*x^3 - x^4). - _Colin Barker_, Aug 24 2017 %t A290990 z = 60; s = x^2/(1-x)^2; p = 1 -s -s^2; %t A290990 Drop[CoefficientList[Series[s, {x,0,z}], x], 1] (* A000027 *) %t A290990 Drop[CoefficientList[Series[1/p, {x,0,z}], x], 1] (* A290990 *) %t A290990 LinearRecurrence[{4,-5,2,1}, {0,1,2,5}, 50] (* _G. C. Greubel_, Apr 12 2023 *) %o A290990 (PARI) concat(0, Vec(x*(1-2*x+2*x^2)/(1-4*x+5*x^2-2*x^3-x^4) + O(x^50))) \\ _Colin Barker_, Aug 24 2017 %o A290990 (Magma) I:=[0,1,2,5]; [n le 4 select I[n] else 4*Self(n-1) -5*Self(n-2) +2*Self(n-3) +Self(n-4): n in [1..50]]; // _G. C. Greubel_, Apr 12 2023 %o A290990 (SageMath) %o A290990 @CachedFunction %o A290990 def a(n): # a = A290990 %o A290990 if (n<4): return (0,1,2,5)[n] %o A290990 else: return 4*a(n-1) -5*a(n-2) +2*a(n-3) +a(n-4) %o A290990 [a(n) for n in range(51)] # _G. C. Greubel_, Apr 12 2023 %Y A290990 Cf. A000027, A033453, A289780, A290890, A290991. %K A290990 nonn,easy %O A290990 0,3 %A A290990 _Clark Kimberling_, Aug 21 2017