425803

Appears in sequences

• Number of connected series-parallel graphs with a longest path of at most n edges and also a largest cut set of at most n edges.at n=4A007803
• Number of (s,5) gates.at n=4A037297
• 1/4 the number of (n+1)X4 0..3 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences.at n=4A209548
• 1/4 the number of (n+1)X6 0..3 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences.at n=2A209550
• T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences.at n=23A209553
• T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences.at n=25A209553
• Array read by antidiagonals: T(n,k) is the number of nonequivalent series-parallel networks with longest path of at most n edges and largest cut set of at most k edges.at n=40A391484