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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A142585 Inverse binomial transform of A014217. 3
1, 0, 1, 0, -1, 5, -14, 35, -81, 180, -389, 825, -1726, 3575, -7349, 15020, -30561, 61965, -125294, 252795, -509161, 1024100, -2057549, 4130225, -8284926, 16609455, -33282989, 66669660, -133507081, 267285605, -535010414, 1070731475, -2142612801, 4287086100 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

LINKS

Table of n, a(n) for n=0..33.

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

FORMULA

a(n) = (-1)^(n+1) * A027974(n-4) for n > 4.

G.f.: (1+3*x+2*x^2+x^3)/((1+2*x)*(1+x-x^2)). - R. J. Mathar, Sep 22 2008

a(n) = (-1)^(n+1)*(2^(n-1)-F(n+1)-F(n-1)), where F(n) = A000045(n), for n>=1, with a(0)=1. - Johannes W. Meijer, Aug 15 2010

a(n) = -3*a(n-1) - a(n-2) + 2*a(n-3). - Wesley Ivan Hurt, Oct 06 2017

CROSSREFS

Cf. A000045, A014217, A027974.

Sequence in context: A227200 A027974 A027983 * A234097 A211562 A261055

Adjacent sequences:  A142582 A142583 A142584 * A142586 A142587 A142588

KEYWORD

sign,easy

AUTHOR

Paul Curtz, Sep 21 2008

EXTENSIONS

Edited and extended by R. J. Mathar, Sep 22 2008

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 December 6 04:14 EST 2019. Contains 329784 sequences. (Running on oeis4.)