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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139382 Triangle read by rows, T(n,k) = (2^n-1) * T(n-1,k) + T(n-1,k-1). 0
1, 1, 1, 1, 4, 1, 1, 13, 11, 1, 1, 40, 90, 26, 1, 1, 121, 670, 480, 57, 1, 1, 364, 4811, 7870, 2247, 120, 1, 1, 1093, 34041, 122861, 77527, 9807, 247, 1 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,5

COMMENTS

Row sums = A135922 starting with offset 1: (1, 2, 6, 26, 158, 1330,...).

FORMULA

Triangle read by rows, T(n,k) = (2^n-1) * T(n-1,k) + (T(n-1,k-1). Let X = an infinite bidiagonal matrix with (1,3,7,15,31...) in the main diagonal and (1,1,1,...) in the subdiagonal. n-th row of the triangle = X^n * [1,0,0,0,...].

EXAMPLE

First few rows of the triangle are:

1;

1, 1;

1, 4, 1;

1, 13, 11, 1;

1, 40, 90, 26, 1;

1, 121, 670, 480, 57, 1;

...

a(13) = T(5,3) = 90 = (2^3 - 1)* T(4,3) + T(4,2) = 7*11 + 13.

CROSSREFS

Cf. A135922.

Sequence in context: A039755 A047874 A080248 * A157180 A179086 A146956

Adjacent sequences:  A139379 A139380 A139381 * A139383 A139384 A139385

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 16 2008

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 14 01:35 EST 2012. Contains 205567 sequences.