login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114114 An invertible partition matrix. 1

%I

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

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

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

%N An invertible partition matrix.

%C Row sums are n+1, A000027. Diagonal sums are 1,1,1,2,2,2,3,3,3,.... or A008620. Inverse is A114115. Product with first difference matrix (1-x,x) is A114117.

%F Number triangle T(n, k)=sum{j=0..n, C(floor((n+j)/2), k)C(k, floor((n+j)/2))}.

%e Triangle begins

%e 1.................=1

%e 1,1...............=2

%e 0,2,1.............=3

%e 0,1,2,1...........=4

%e 0,0,2,2,1.........=5

%e 0,0,1,2,2,1.......=6

%e 0,0,0,2,2,2,1.....=7

%e 0,0,0,1,2,2,2,1...=8

%K easy,nonn,tabl

%O 0,5

%A _Paul Barry_, Nov 13 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 18:03 EDT 2019. Contains 328102 sequences. (Running on oeis4.)