116187

Appears in sequences

• The number of degree sequences with degree sum 2n representable by a non-separable graph (with multiple edges allowed).at n=29A147877
• Number of (n+1)X(1+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal.at n=5A237474
• Number of (n+1)X(6+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal.at n=0A237479
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal.at n=15A237481
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal.at n=20A237481