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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A363398 Triangle read by rows. T(n, k) = [x^k] P(n, x), where P(n, x) = Sum_{k=0..n} 2^(n - k) * Sum_{j=0..k} (x^j * binomial(k, j) * (2*j + 1)^n), (secant case). 3

%I #18 Oct 06 2023 04:26:12

%S 1,3,3,7,36,25,15,297,625,343,31,2106,10000,14406,6561,63,13851,

%T 131250,369754,413343,161051,127,87480,1546875,7529536,15411789,

%U 14172488,4826809,255,540189,17109375,134237509,444816117,721025327,564736653,170859375

%N Triangle read by rows. T(n, k) = [x^k] P(n, x), where P(n, x) = Sum_{k=0..n} 2^(n - k) * Sum_{j=0..k} (x^j * binomial(k, j) * (2*j + 1)^n), (secant case).

%C Here we give an inclusion-exclusion representation of 2^n*Euler(n) (see A122045 and A002436), in A363399 we give such a representation for 2^n*Euler(n, 1) = A155585(n), and in A363400 one for the combined sequences.

%H <a href="/index/Eu#Euler">Index entries for sequences related to Euler numbers.</a>

%F Sum_{k=0..n} (-1)^k*T(n, k) = 2^n*Euler(n) = 4^n*Euler(n, 1/2).

%F (Sum_{k=0..n} (-1)^k*T(n, k)) / 2^n = Euler(n) = 2^n*Euler(n, 1/2) = A122045(n).

%F Sum_{k=0..2n}((-1)^k*T(2*n, k) = 4^n*Euler(2*n) = 16^n*Euler(2*n, 1/2) = (-1)^n*A002436(n).

%F From _Detlef Meya_, Oct 04 2023: (Start)

%F T(n, k) = (2*k + 1)^n * binomial(n+1, k+1) * hypergeom([1, k-n], [k+2], -1).

%F T(n, k) = (2*k + 1)^n * (2^(n + 1) - Sum_{j=0..k} binomial(n+1, j). (End)

%e The triangle T(n, k) starts:

%e [0] 1;

%e [1] 3, 3;

%e [2] 7, 36, 25;

%e [3] 15, 297, 625, 343;

%e [4] 31, 2106, 10000, 14406, 6561;

%e [5] 63, 13851, 131250, 369754, 413343, 161051;

%e [6] 127, 87480, 1546875, 7529536, 15411789, 14172488, 4826809;

%e [7] 255, 540189, 17109375, 134237509, 444816117, 721025327, 564736653, 170859375;

%p P := (n, x) -> add(add(x^j*binomial(k, j)*(2*j + 1)^n, j=0..k)*2^(n-k), k=0..n):

%p T := (n, k) -> coeff(P(n, x), x, k): seq(seq(T(n, k), k = 0..n), n = 0..7);

%t (* From _Detlef Meya_, Oct 04 2023: (Start) *)

%t T[n_, k_] := (2*k+1)^n*(2^(n+1) - Sum[Binomial[n+1, j], {j,0,k}]);

%t (* Or: *)

%t T[n_, k_] := (2*k+1)^n*Binomial[n+1, k+1]*Hypergeometric2F1[1, k-n, k+2, -1];

%t Flatten[Table[T[n, k], {n, 0, 7}, {k, 0, n}]] (* End *)

%Y Cf. A122045 (alternating row sums), A363396 (row sums), A126646 (column 0), A085527 (main diagonal), A141475 (central terms).

%Y Cf. A363399 (tangent case), A363400 (combined case).

%Y Cf. A122045, A002436.

%K nonn,tabl

%O 0,2

%A _Peter Luschny_, May 31 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 11:24 EDT 2024. Contains 376000 sequences. (Running on oeis4.)