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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014909 a(1)=1, a(n) = 23*a(n-1) + n. 2
1, 25, 578, 13298, 305859, 7034763, 161799556, 3721389796, 85591965317, 1968615202301, 45278149652934, 1041397442017494, 23952141166402375, 550899246827254639, 12670682677026856712, 291425701571617704392 (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 (25, -47, 23).

FORMULA

a(n) = -23/484 - (1/22)*n + (23/484)*23^n. - Paolo P. Lava, Jan 14 2009

a(1)=1, a(2)=25, a(3)=578, a(n) = 25*a(n-1) - 47*a(n-2) + 23*a(n-3). - Harvey P. Dale, Feb 05 2012

G.f.: -(x/((-1+x)^2*(-1+23*x))). - Harvey P. Dale, Feb 05 2012

MATHEMATICA

Transpose[NestList[{First[#]+1, 23Last[#]+First[#]+1}&, {1, 1}, 20]][[2]] (* or *) LinearRecurrence[{25, -47, 23}, {1, 25, 578}, 20] (* Harvey P. Dale, Feb 05 2012 *)

PROG

(MAGMA) I:=[1, 25, 578]; [n le 3 select I[n] else 25*Self(n-1)-47*Self(n-2)+23*Self(n-3): n in [1..30]]; // Vincenzo Librandi, Feb 05 2012

CROSSREFS

Sequence in context: A264378 A015679 A230454 * A239822 A264220 A228827

Adjacent sequences:  A014906 A014907 A014908 * A014910 A014911 A014912

KEYWORD

nonn,easy

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 July 17 14:44 EDT 2019. Contains 325106 sequences. (Running on oeis4.)