A350771 Triangle read by rows: T(n, k) = (2^(n-k-1) + 2^k - 2)*binomial(n-1, k), 0 <= k <= n-1.

0, 1, 1, 3, 4, 3, 7, 12, 12, 7, 15, 32, 36, 32, 15, 31, 80, 100, 100, 80, 31, 63, 192, 270, 280, 270, 192, 63, 127, 448, 714, 770, 770, 714, 448, 127, 255, 1024, 1848, 2128, 2100, 2128, 1848, 1024, 255, 511, 2304, 4680, 5880, 5796, 5796, 5880, 4680, 2304, 511, 1023, 5120, 11610, 16080, 16380, 15624, 16380, 16080, 11610, 5120, 1023

Offset

1,4

Comments

The elements in T(n,k) result from the product of each element of A350770(n,k) and binomial(n-1,k).

Links

Andrew Howroyd, Table of n, a(n) for n = 1..1275 (rows 1..50)

Ambrosio Valencia-Romero and P. T. Grogan, The strategy dynamics of collective systems: Underlying hindrances beyond two-actor coordination, PLOS ONE 19(4): e0301394 (S1 Appendix).

Formula

T(n, k) = (2^(n-k-1) + 2^k - 2)*binomial(n-1, k).

Example

Triangle begins:
     0;
     1,    1;
     3,    4,     3;
     7,   12,    12,     7;
    15,   32,    36,    32,    15;
    31,   80,   100,   100,    80,    31;
    63,  192,   270,   280,   270,   192,    63;
   127,  448,   714,   770,   770,   714,   448,   127;
   255, 1024,  1848,  2128,  2100,  2128,  1848,  1024,   255;
   511, 2304,  4680,  5880,  5796,  5796,  5880,  4680,  2304,  511;
  1023, 5120, 11610, 16080, 16380, 15624, 16380, 16080, 11610, 5120, 1023;
...

Maple

T := n -> local k; seq((2^(n - k - 1) + 2^k - 2)*binomial(n - 1, k), k = 0 .. n - 1);
seq(T(n), n = 1 .. 11);

Prog

(PARI) T(n, k) = (2^(n-k-1) + 2^k - 2)*binomial(n-1, k) \\ Andrew Howroyd, Jan 05 2024

Crossrefs

Column k=0 gives A000225(n-1).

Row sums give A056182(n-1) = 2*A001047(n-1).

Sequence in context: A299416 A333974 A163108 * A077005 A328347 A265723

Adjacent sequences: A350768 A350769 A350770 * A350772 A350773 A350774

Keyword

nonn,tabl

Author

Ambrosio Valencia-Romero, Jan 14 2022

Status

approved