OFFSET
1,1
COMMENTS
Fifth diagonal of the array which contains m-acci numbers in the m-th row.
The base array is constructed from m-acci numbers starting each with 1, 1, and 2 and filling one row of the table (see the examples.)
The main and the upper diagonals of the table are the powers of 2, A000079.
The next subdiagonal is this sequence here, followed by A159742, A159743, A159744, A159746, A159747, A159748.
a(n) written in base 2: 1000, 11000, 111000, 1111000, ..., i.e., n times 1 and 3 times 0 (A161770). - Jaroslav Krizek, Jun 18 2009
Also numbers for which n^8/(n+8) is an integer. - Vicente Izquierdo Gomez, Jan 03 2013
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (3, -2).
FORMULA
From R. J. Mathar, Apr 22 2009: (Start)
a(n) = 3*a(n-1) - 2*a(n-2).
a(n) = 8*(2^n-1).
G.f.: 8*x/((2*x-1)*(x-1)). (End)
From Jaroslav Krizek, Jun 18 2009: (Start)
a(n) = Sum_{i=3..(n+2)} 2^i.
a(n) = Sum_{i=1..n} 2^(i+2).
a(n) = a(n-1) + 2^(n+2) for n >= 2. (End)
EXAMPLE
From R. J. Mathar, Apr 22 2009: (Start)
The base table is
.1..1....1....1....1....1....1....1....1....1....1....1....1....1
.1..1....1....1....1....1....1....1....1....1....1....1....1....1
.2..2....2....2....2....2....2....2....2....2....2....2....2....2
.0..2....3....4....4....4....4....4....4....4....4....4....4....4
.0..2....5....7....8....8....8....8....8....8....8....8....8....8
.0..2....8...13...15...16...16...16...16...16...16...16...16...16
.0..2...13...24...29...31...32...32...32...32...32...32...32...32
.0..2...21...44...56...61...63...64...64...64...64...64...64...64
.0..2...34...81..108..120..125..127..128..128..128..128..128..128
.0..2...55..149..208..236..248..253..255..256..256..256..256..256
.0..2...89..274..401..464..492..504..509..511..512..512..512..512
.0..2..144..504..773..912..976.1004.1016.1021.1023.1024.1024.1024
.0..2..233..927.1490.1793.1936.2000.2028.2040.2045.2047.2048.2048
.0..2..377.1705.2872.3525.3840.3984.4048.4076.4088.4093.4095.4096
MAPLE
T := proc(n, m) option remember ; if n < 0 then 0; elif n <= 1 then 1; elif n = 2 then 2; else add(procname(n-i, m), i=1..m) ; fi: end: A159741 := proc(n) T(n+4, n+1) ; end: seq(A159741(n), n=1..40) ; # R. J. Mathar, Apr 22 2009
MATHEMATICA
Table[8(2^n-1), {n, 60}] (* Vladimir Joseph Stephan Orlovsky, Apr 18 2011 *)
LinearRecurrence[{3, -2}, {8, 24}, 30] (* Harvey P. Dale, Jan 01 2019 *)
PROG
(PARI) a(n)=8*(2^n-1) \\ Charles R Greathouse IV, Sep 24 2015
(Magma) [8*(2^n -1): n in [1..50]]; // G. C. Greubel, May 22 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Al Hakanson (hawkuu(AT)gmail.com), Apr 20 2009
EXTENSIONS
More terms from R. J. Mathar, Apr 22 2009
Edited by Al Hakanson (hawkuu(AT)gmail.com), May 11 2009
Comments claiming negative entries deleted by R. J. Mathar, Aug 24 2009
STATUS
approved