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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064746 a(n) = n*8^n + 1. 3
1, 9, 129, 1537, 16385, 163841, 1572865, 14680065, 134217729, 1207959553, 10737418241, 94489280513, 824633720833, 7146825580545, 61572651155457, 527765581332481, 4503599627370497, 38280596832649217, 324259173170675713 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = 17*a(n-1) - 80*a(n-2) + 64*a(n-3), a(0)=1, a(1)=9, a(2)=129. - Harvey P. Dale, Jul 24 2012
G.f.: -(56*x^2-8*x+1)/((x-1)*(8*x-1)^2). - Colin Barker, Oct 15 2012
MATHEMATICA
Table[n*8^n+1, {n, 0, 20}] (* or *) LinearRecurrence[{17, -80, 64}, {1, 9, 129}, 20] (* Harvey P. Dale, Jul 24 2012 *)
PROG
(PARI) { for (n=0, 150, write("b064746.txt", n, " ", n*8^n + 1) ) } \\ Harry J. Smith, Sep 24 2009
CROSSREFS
Cf. A002064.
Sequence in context: A046754 A203425 A275259 * A232950 A184143 A287690
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Oct 19 2001
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 8 08:02 EST 2023. Contains 367662 sequences. (Running on oeis4.)