login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291243 p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - 3 S + S^2. 2
3, 8, 24, 71, 210, 621, 1836, 5428, 16047, 47440, 140247, 414612, 1225716, 3623579, 10712370, 31668929, 93622704, 276776352, 818232603, 2418937120, 7151092203, 21140739568, 62498266944, 184763326671, 546214936050, 1614772594421, 4773744472356, 14112597876668 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

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 A291219 for a guide to related sequences.

LINKS

Clark Kimberling, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (3,1,-3,-1)

FORMULA

G.f.: (3 - x - 3*x^2)/(1 - 3*x - x^2 + 3*x^3 + x^4).

a(n) = 3*a(n-1) + a(n-2) - 3*a(n-3) - a(n-4) for n >= 5.

MATHEMATICA

z = 60; s = x/(1 - x^2); p = 1 - 3 s - s^2;

Drop[CoefficientList[Series[s, {x, 0, z}], x], 1]  (* A000035 *)

Drop[CoefficientList[Series[1/p, {x, 0, z}], x], 1]  (* A291243 *)

CROSSREFS

Cf. A000035, A291219.

Sequence in context: A238126 A079121 A027077 * A153774 A052855 A133787

Adjacent sequences:  A291240 A291241 A291242 * A291244 A291245 A291246

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Aug 28 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 16:16 EDT 2019. Contains 326295 sequences. (Running on oeis4.)