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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014903 a(1)=1, a(n) = 19*a(n-1) + n. 2
1, 21, 402, 7642, 145203, 2758863, 52418404, 995949684, 18923044005, 359537836105, 6831218886006, 129793158834126, 2466070017848407, 46855330339119747, 890251276443275208, 16914774252422228968, 321380710796022350409, 6106233505124424657789 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..200

Index entries for linear recurrences with constant coefficients, signature (21, -39, 19).

FORMULA

a(n) = -19/324 - (1/18)*n + (19/324)*19^n, with n >= 1. - Paolo P. Lava, Jan 14 2009

a(1)=1, a(2)=21, a(3)=402, a(n) = 21*a(n-1) - 39*a(n-2) + 19*a(n-3). - Vincenzo Librandi, Oct 20 2012

MATHEMATICA

LinearRecurrence[{21, -39, 19}, {1, 21, 402}, 20] (* Vincenzo Librandi, Oct 20 2012 *)

PROG

(MAGMA) I:=[1, 21, 402]; [n le 3 select I[n] else 21*Self(n-1) - 39*Self(n-2) + 19*Self(n-3): n in [1..20]]; // Vincenzo Librandi, Oct 20 2012

CROSSREFS

Sequence in context: A113363 A223459 A240655 * A219308 A020534 A106656

Adjacent sequences:  A014900 A014901 A014902 * A014904 A014905 A014906

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Olivier Gérard

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 19 21:19 EDT 2019. Contains 326133 sequences. (Running on oeis4.)