proposed
approved
proposed
approved
editing
proposed
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^2 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).
<a href="/index/Rec#order_0408">Index entries for linear recurrences with constant coefficients</a>, signature (1, 5, -2, -6, 1, 4, 0, -1)
proposed
editing
editing
proposed
Suppose s = (c(0), c(1), c(2), ...) is a sequence and p(S) is a polynomial. Let S(x) = c(0) + c(1)*x + c(2)*x^2 + ... 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).
proposed
editing
editing
proposed
allocated for Clark Kimberling
p-INVERT of (1,0,2,0,3,0,4,0,5,...) (A027656), where p(S) = 1 - S - S^2.
1, 2, 5, 13, 29, 73, 168, 410, 962, 2317, 5483, 13131, 31193, 74509, 177311, 423025, 1007505, 2402354, 5723761, 13644587, 32514730, 77501115, 184698088, 440216833, 1049148789, 2500520812, 5959478837, 14203542282, 33851496564, 80679640434, 192285583548
0,2
Suppose s = (c(0), c(1), c(2),...) is a sequence and p(S) is a polynomial. Let S(x) = c(0) + c(1)*x + c(2)*x^2 + ... 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).
See A289780 for a guide to related sequences.
Clark Kimberling, <a href="/A289843/b289843.txt">Table of n, a(n) for n = 0..1000</a>
<a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1, 5, -2, -6, 1, 4, 0, -1)
G.f.: (1 + x - 2 x^2 + x^4)/(1 - x - 5 x^2 + 2 x^3 + 6 x^4 - x^5 - 4 x^6 + x^8).
a(n) = a(n-1) + 5*a(n-2) - 2*a(n-3) - 6*a(n-4) + a(n-5) + 4*a(n-6) - a(n-8).
allocated
nonn,easy
Clark Kimberling, Aug 12 2017
approved
editing
allocating
allocated
allocated for Clark Kimberling
allocating
approved