login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291142 a(n) = (1/4)*A291024(n). 2
0, 1, 2, 6, 16, 43, 114, 300, 784, 2037, 5266, 13554, 34752, 88799, 226210, 574680, 1456352, 3682409, 9292002, 23403102, 58842416, 147713043, 370262930, 926852868, 2317191024, 5786293597, 14433117938, 35964267594, 89528469088, 222666575815, 553319176770 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
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).
See A291000 for a guide to related sequences.
LINKS
FORMULA
G.f.: -(((-x + 2 x^2))/(-1 + 2 x + x^2)^2).
a(n) = 4*a(n-1) - 2 a(n-2) - 4*a(n-3) - a(n-4) for n >= 5.
a(n) = (1/4)*A291024(n) for n >= 0.
a(n) = ((1+sqrt(2))^n*(3*sqrt(2) + 2*(-1+sqrt(2))*n) - (1-sqrt(2))^n*(3*sqrt(2) + 2*(1+sqrt(2))*n)) / 16. - Colin Barker, Aug 24 2017
MATHEMATICA
z = 60; s = x/(1 - x); p = 1 - 3 s^2 + 2 s^3;
Drop[CoefficientList[Series[s, {x, 0, z}], x], 1] (* A000012 *)
Drop[CoefficientList[Series[1/p, {x, 0, z}], x], 1] (* A291024 *)
u/4 (* A291142 *)
PROG
(PARI) concat(0, Vec(x*(1 - 2*x) / (1 - 2*x - x^2)^2 + O(x^40))) \\ Colin Barker, Aug 24 2017
CROSSREFS
Sequence in context: A224232 A217661 A244399 * A027994 A319503 A295572
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Aug 24 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:21 EDT 2024. Contains 371794 sequences. (Running on oeis4.)