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!)
A014931 a(1)=1, a(n) = n*16^(n-1) + a(n-1). 2
1, 33, 801, 17185, 344865, 6636321, 124076833, 2271560481, 40926266145, 728121033505, 12822748939041, 223928981472033, 3883103678710561, 66933498461897505, 1147797409030816545, 19594541482740368161 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..16.

Index entries for linear recurrences with constant coefficients, signature (33,-288,256).

FORMULA

a(n) = (1+16^n*(15*n-1))/225. - Paolo P. Lava, Jan 13 2009

G.f.: x/((1 - x)*(1 - 16*x)^2). - Stefano Spezia, Mar 11 2020

MATHEMATICA

RecurrenceTable[{a[1]==1, a[n]==n*16^(n-1)+a[n-1]}, a, {n, 20}] (* Harvey P. Dale, Sep 17 2019 *)

PROG

(PARI) a(n) = (1+16^n*(15*n-1))/225; \\ Jinyuan Wang, Mar 11 2020

CROSSREFS

Sequence in context: A164750 A100788 A051565 * A197358 A299074 A101632

Adjacent sequences: A014928 A014929 A014930 * A014932 A014933 A014934

KEYWORD

nonn,easy

AUTHOR

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 07:34 EST 2022. Contains 358454 sequences. (Running on oeis4.)