The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060195 a(n) = 8^(n-1)*(2^n-1). 3
 1, 24, 448, 7680, 126976, 2064384, 33292288, 534773760, 8573157376, 137304735744, 2197949513728, 35175782154240, 562881233944576, 9006649498927104, 144110790029344768, 2305807824841605120 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harry J. Smith, Table of n, a(n) for n = 1..100 Index entries for linear recurrences with constant coefficients, signature (24, -128). FORMULA a(1)=1, a(2)=24, a(n) = 24*a(n-1) - 128*a(n-2). - Harvey P. Dale, Oct 20 2014 MATHEMATICA Table[8^(n-1) (2^n-1), {n, 20}] (* or *) LinearRecurrence[{24, -128}, {1, 24}, 20] (* Harvey P. Dale, Oct 20 2014 *) PROG (PARI) { for (n=1, 100, write("b060195.txt", n, " ", 8^(n - 1)*(2^n - 1)); ) } \\ Harry J. Smith, Jul 02 2009 CROSSREFS Sequence in context: A006260 A187625 A024303 * A114201 A263476 A263470 Adjacent sequences:  A060192 A060193 A060194 * A060196 A060197 A060198 KEYWORD nonn,easy AUTHOR Manish Kumar Gupta (M.Gupta(AT)math.canterbury.ac.nz), Mar 21 2001 EXTENSIONS More terms from Jason Earls and Larry Reeves (larryr(AT)acm.org), Mar 21 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 30 17:12 EST 2021. Contains 349424 sequences. (Running on oeis4.)