44050
domain: N
Appears in sequences
- Let b(0)=0; b(1)=1; b(n+2)=(e^g-1/e^g)*b(n+1)+b(n). a(n)=floor(b(n)).at n=20A090427
- Number of (n+1)X(n+1) 0..2 arrays with rows and columns in nondecreasing order and with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.at n=3A184072
- Number of (n+1)X5 0..2 arrays with rows and columns in nondecreasing order and with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.at n=3A184076
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with rows and columns in nondecreasing order and with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.at n=24A184081