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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277975 a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=5. 1
1, 6, 56, 431, 2931, 18556, 112306, 659181, 3784181, 21362306, 119018556, 656127931, 3585815431, 19454956056, 104904174806, 562667846681, 3004074096681, 15974044799806, 84638595581056, 447034835815431, 2354383468627931, 12367963790893556, 64820051193237306 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Colin Barker, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (11,-35,25).

FORMULA

G.f.: (1 - 5*x + 25*x^2)/((1 - x)*(1 - 5*x)^2).

a(n) = 11*a(n-1) - 35*a(n-2) + 25*a(n-3) for n>2.

a(n) = (21 - 5^(1+n) + 4*5^(1+n)*n)/16.

EXAMPLE

a(3) = 3*5^3 + (3-1)*5^(3-1) + 5 + 1 = 431.

PROG

(PARI) Vec((1-5*x+25*x^2)/((1-x)*(1-5*x)^2) + O(x^30)) \\ Colin Barker, Nov 07 2016

CROSSREFS

Cf. A088581, A088582.

Sequence in context: A074018 A074016 A183513 * A155613 A183586 A166177

Adjacent sequences:  A277972 A277973 A277974 * A277976 A277977 A277978

KEYWORD

nonn,easy

AUTHOR

Colin Barker, Nov 07 2016

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 14 21:33 EST 2017. Contains 296020 sequences.