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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015528 a(n) = 3*a(n-1) + 10*a(n-2). 13
0, 1, 3, 19, 87, 451, 2223, 11179, 55767, 279091, 1394943, 6975739, 34876647, 174387331, 871928463, 4359658699, 21798260727, 108991369171, 544956714783, 2724783836059, 13623918656007, 68119594328611, 340597969545903 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

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

FORMULA

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

a(n) = 5^n/7-(-2)^n/7. Binomial transform is A015540. - Paul Barry, Feb 07 2004

G.f.: x/(1-x*(10*x+3)) [From Harvey P. Dale, Jan 27 2012]

MATHEMATICA

Join[{a=0, b=1}, Table[c=3*b+10*a; a=b; b=c, {n, 100}]] (*From Vladimir Joseph Stephan Orlovsky, Jan 16 2011*)

LinearRecurrence[{3, 10}, {0, 1}, 30] (* or *) CoefficientList[Series[x/(1-x (10x+3)), {x, 0, 29}], x] (* From Harvey P. Dale, Jan 27 2012 *)

PROG

(Sage) [lucas_number1(n, 3, -10) for n in xrange(0, 23)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 22 2009]

(MAGMA) [5^n/7-(-2)^n/7: n in [0..30]]; // Vincenzo Librandi, Aug 23 2011

CROSSREFS

Sequence in context: A167242 A089621 A204256 * A183384 A050863 A049153

Adjacent sequences:  A015525 A015526 A015527 * A015529 A015530 A015531

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 23 08:31 EST 2012. Contains 206628 sequences.