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!)
A129184 Shift operator, right. 7

%I #23 Feb 18 2022 22:35:43

%S 0,1,0,0,1,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,

%T 1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,

%U 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0

%N Shift operator, right.

%C Let A129184 = matrix M, then M*V, (V a vector); shifts V to the right, preceded by zeros. Example: M*V, V = [1, 2, 3, ...] = [0, 1, 2, 3, ...]. A129185 = left shift operator.

%C Given a polynomial sequence p_n(x) with p_0(x)=1 and the lowering and raising operators L and R defined by L P_n(x)= n * P_(n-1)(x) and R P_n(x)= P_(n+1)(x), the matrix T represents the action of R in the p_n(x) basis. For p_n(x) = x^n, L = D = d/dx and R = x. For p_n(x)= x^n/n!, L= DxD and R=D^(-1). - _Tom Copeland_, Nov 10 2012

%H Andrew Howroyd, <a href="/A129184/b129184.txt">Table of n, a(n) for n = 1..1275</a>

%F Infinite lower triangular matrix with all 1's in the subdiagonal and the rest zeros.

%F From _Tom Copeland_, Nov 10 2012: (Start)

%F Let M(t) = I/(I-t*T) = I + t*T + (t*T)^2 + ... where T is the shift operator matrix and I the Identity matrix. Then the inverse matrix is MI(t)=(I-tT) and M(t) is A000012 with each n-th diagonal multiplied by t^n. M(1)=A000012 with inverse MI(1)=A167374. Row sums of M(2), M(3), and M(4) are A000225, A003462, and A002450.

%F Let E(t)=exp(t*T) with inverse E(-t). Then E(t) is A000012 with each n-th diagonal multiplied by t^n/n! and each row represents e^t truncated at the n+1 term.

%F The matrix operation b = T*a can be characterized in several ways in terms of the coefficients a(n) and b(n), their o.g.f.s A(x) and B(x), or e.g.f.s EA(x) and EB(x):

%F 1) b(0) = 0, b(n) = a(n-1),

%F 2) B(x) = x A(x), or

%F 3) EB(x) = D^(-1) EA(x), where D^(-1)x^j/j! = x^(j+1)/(j+1)!.

%F The operator M(t) can be characterized as

%F 4)M(t)EA(x)= sum(n>=0)a(n)[e^(x*t)-[1+x*t+...+ (x*t)^(n-1)/(n-1)!]]/t^n

%F = exp(a*D_y)[t*e^(x*t)-y*e(x*y)]/(t-y) <evaluated at y=0>

%F = [t*e^(x*t)-a*e(x*a)]/(t-a), umbrally where (a)^k=a_k,

%F 5)[M(t) * a]_n = a(0)t^n +a(1)t^(n-1)+a(2)t^(n-2)+...+a(n).

%F The exponentiated operator can be characterized as

%F 6) E(t) A(x) = exp(t*x) A(x),

%F 7) E(t) EA(x) = exp(t*D^(-1)) EA(x)

%F 8) [E(t) * a]_n = a(0)t^n/n! + a(1)t^(n-1)/(n-1)! + ... + a(n).

%F (End)

%F a(n) = A010054(n+1). - _Andrew Howroyd_, Feb 02 2020

%e First few rows of the triangle:

%e 0;

%e 1, 0;

%e 0, 1, 0;

%e 0, 0, 1, 0;

%e 0, 0, 0, 1, 0;

%e ...

%Y Cf. A129185, A129186.

%Y Cf. A010054.

%K nonn,tabl,less,easy

%O 1,1

%A _Gary W. Adamson_, Apr 01 2007

%E Terms a(46) and beyond from _Andrew Howroyd_, Feb 02 2020

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 28 15:28 EDT 2024. Contains 371254 sequences. (Running on oeis4.)