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!)
A162169 Exponential series expansion of (cos(x) - sin(x))*cosh(t*x) + sinh(t*x). 2

%I #45 Sep 18 2021 17:44:59

%S 1,-1,1,-1,0,1,1,0,-3,1,1,0,-6,0,1,-1,0,10,0,-5,1,-1,0,15,0,-15,0,1,1,

%T 0,-21,0,35,0,-7,1,1,0,-28,0,70,0,-28,0,1,-1,0,36,0,-126,0,84,0,-9,1,

%U -1,0,45,0,-210,0,210,0,-45,0,1,1,0,-55,0,330,0,-462,0,165,0,-11,1

%N Exponential series expansion of (cos(x) - sin(x))*cosh(t*x) + sinh(t*x).

%C Previous name was: Signed version of Pascal's triangle.

%C Related to A000111 via its matrix inverse A162170.

%C For odd columns k, T(n, k) = binomial(n-1, k-1) * (-1)^floor((n+k-1)/2). For even columns, T(n, k) = 1 if n = k, otherwise 0. - _Mike Tryczak_, Jun 17 2015

%C From _Peter Bala_, Sep 08 2021: (Start)

%C In the notation of the Bala link, this is the array [[ cos(x) - sin(x), 1 ]] with inverse array A162170 = [[ sec(x) + tan(x), 1 ]].

%C In general, arrays of the form [[ G(x), 1 ]], where G(x) = 1 + g(1)*x + g(2)*x^2/2! + g(3)*x^3/3! + ... is an e.g.f., form a group with group law [[ G(x), 1 ]]*[[ F(x), 1 ]] = [[ G(x)*F_e(x) + F_o(x), 1 ]] and inverse array [[ G(x), 1 ]]^(-1) = [[ (1 - G_o(x))/G_e(x), 1 ]], where G_e(x) = (G(x) + G(-x))/2 and G_o(x) = (G(x) - G(-x))/2 are the even and odd parts of G(x). (End)

%H Peter Bala, <a href="/A177994/a177994.pdf">Matrices with repeated columns - the generalised Appell groups</a>

%F E.g.f.: (cos(x) - sin(x))*cosh(t*x) + sinh(t*x) = 1 + (-1 + t)*x + (-1 + t^2)*x^2/2! + (1 - 3^t^2 + t^3)*x^3/3! + .... - _Peter Bala_, Sep 08 2021

%e Table begins:

%e 1;

%e -1, 1;

%e -1, 0, 1;

%e 1, 0, -3, 1;

%e 1, 0, -6, 0, 1;

%e -1, 0, 10, 0, -5, 1;

%e -1, 0, 15, 0, -15, 0, 1;

%e 1, 0, -21, 0, 35, 0, -7, 1;

%e 1, 0, -28, 0, 70, 0, -28, 0, 1;

%e -1, 0, 36, 0, -126, 0, 84, 0, -9, 1;

%e -1, 0, 45, 0, -210, 0, 210, 0, -45, 0, 1;

%e 1, 0, -55, 0, 330, 0, -462, 0, 165, 0, -11, 1;

%e .

%e As a symmetric triangle:

%e 1;

%e -1, 1;

%e -1, 0, 1;

%e 1, 0, -3, 1;

%e 1, 0, -6, 0, 1;

%e -1, 0, 10, 0, -5, 1;

%e -1, 0, 15, 0, -15, 0, 1;

%e 1, 0, -21, 0, 35, 0, -7, 1;

%e 1, 0, -28, 0, 70, 0, -28, 0, 1;

%e -1, 0, 36, 0, -126, 0, 84, 0, -9, 1;

%e -1, 0, 45, 0, -210, 0, 210, 0, -45, 0, 1;

%e 1, 0, -55, 0, 330, 0, -462, 0, 165, 0, -11, 1;

%p egf := (cos(x) - sin(x))*cosh(t*x) + sinh(t*x):

%p ser := n -> series(egf, x, n+1): c := n -> n!*coeff(ser(n), x, n):

%p A162169row := n -> seq(coeff(c(n), t, k), k=0..n):

%p for n from 0 to 9 do A162169row(n) od; # _Peter Luschny_, Sep 18 2021

%t nn=12; Flatten[Table[Table[If[Or[Mod[n - k, 4] == 1, Mod[n - k, 4] == 2], -1, 1]*If[n >= k, Binomial[n - 1, k - 1], 0]*If[And[n > k, Mod[k, 2] == 0], 0, 1], {k, 1, n}], {n, 1, nn}]] (* _Mats Granvik_, Nov 25 2017 *)

%o (Excel) =if(or(mod(row()-column();4)=1;mod(row()-column();4)=2);-1;1)*if(row()>=column();combin(row()-1;column()-1);0)*if(and(row()>column();mod(column();2)=0);0;1)

%o (PARI) T(n, k) = if (k % 2, binomial(n-1, k-1) * (-1)^floor((n+k-1)/2), if (n==k, 1 , 0));

%o tabl(nn) = {for (n=1, nn, for (k=1, n, print1(T(n,k), ", ");); print(););} \\ _Michel Marcus_, Jun 17 2015

%Y Cf. A007318, A162170.

%K sign,tabl

%O 1,9

%A _Mats Granvik_, Jun 27 2009

%E New name using a formula of _Peter Bala_ from _Peter Luschny_, Sep 18 2021

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 March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)