login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125103 Triangle read by rows: T(n,k) = binomial(n,k) + 2^k*binomial(n,k+1) (0 <= k <= n). 2
1, 2, 1, 3, 4, 1, 4, 9, 7, 1, 5, 16, 22, 12, 1, 6, 25, 50, 50, 21, 1, 7, 36, 95, 140, 111, 38, 1, 8, 49, 161, 315, 371, 245, 71, 1, 9, 64, 252, 616, 966, 952, 540, 136, 1, 10, 81, 372, 1092, 2142, 2814, 2388, 1188, 265, 1, 11, 100, 525, 1800, 4242, 6972, 7890, 5880, 2605, 522, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Row sums = A094374: (1, 3, 8, 21, 56, ...).
Binomial transform of the infinite bidiagonal matrix with (1,1,1,...) in the main diagonal and (1,2,4,8,...) in the subdiagonal.
LINKS
EXAMPLE
First few rows of the triangle are
1;
2, 1;
3, 4, 1;
4, 9, 7, 1;
5, 16, 22, 12, 1;
6, 25, 50, 50, 21, 1;
7, 36, 95, 140, 111, 38, 1;
...
MAPLE
T:=(n, k)->binomial(n, k)+2^k*binomial(n, k+1): for n from 0 to 11 do seq(T(n, k), k=0..n) od; # yields sequence in triangular form
MATHEMATICA
Table[Binomial[n, k]+2^k Binomial[n, k+1], {n, 0, 10}, {k, 0, n}]//Flatten (* Harvey P. Dale, Nov 30 2019 *)
PROG
(PARI) T(n, k) = binomial(n, k) + 2^k*binomial(n, k+1);
matrix(11, 11, n, k, T(n-1, k-1)) \\ Michel Marcus, Nov 09 2019
CROSSREFS
Cf. A094374.
Sequence in context: A104698 A067066 A210219 * A171275 A335312 A284873
KEYWORD
nonn,tabl
AUTHOR
Gary W. Adamson, Nov 20 2006
EXTENSIONS
Edited by N. J. A. Sloane, Nov 29 2006
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 April 19 02:28 EDT 2024. Contains 371782 sequences. (Running on oeis4.)