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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048468 a(n) = T(7,n), array T given by A047858. 1
1, 9, 26, 62, 138, 298, 634, 1338, 2810, 5882, 12282, 25594, 53242, 110586, 229370, 475130, 983034, 2031610, 4194298, 8650746, 17825786, 36700154, 75497466, 155189242, 318767098, 654311418, 1342177274, 2751463418 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..3000

FORMULA

a(n) = 2^(n-1)*(n+14)-6. a(0)=1, a(1)=9, a(2)=26, a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3). - Vincenzo Librandi, Sep 28 2011

PROG

(MAGMA) [2^(n-1)*(n+14)-6: n in [0..30]]; // Vincenzo Librandi, Sep 28 2011

CROSSREFS

n-th difference of a(n), a(n-1), ..., a(0) is (8, 9, 10, ...).

Sequence in context: A081267 A052153 A154560 * A048771 A055849 A084813

Adjacent sequences:  A048465 A048466 A048467 * A048469 A048470 A048471

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 15:20 EST 2012. Contains 205823 sequences.