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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A012864 Take every 5th term of Padovan sequence A000931, beginning with the first term. 2
1, 1, 3, 12, 49, 200, 816, 3329, 13581, 55405, 226030, 922111, 3761840, 15346786, 62608681, 255418101, 1042002567, 4250949112, 17342153393, 70748973084, 288627200960, 1177482265857, 4803651498529, 19596955630177 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (5, -4, 1).

FORMULA

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

O.g.f.: (1-4x+2x^2)/(1-5x+4x^2-x^3). a(n+1)=A012772(n). - R. J. Mathar, May 28 2008

MATHEMATICA

LinearRecurrence[{5, -4, 1}, {1, 1, 3}, 30] (* Vincenzo Librandi, Apr 18 2012 *)

PROG

(Magma) I:=[1, 1, 3]; [n le 3 select I[n] else 5*Self(n-1)-4*Self(n-2)+Self(n-3): n in [1..30]]; // Vincenzo Librandi, Apr 18 2012

CROSSREFS

Cf. A012855.

Sequence in context: A037758 A037646 A012772 * A045890 A049673 A052703

Adjacent sequences: A012861 A012862 A012863 * A012865 A012866 A012867

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

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 November 28 22:51 EST 2022. Contains 358421 sequences. (Running on oeis4.)