101644

Appears in sequences

• Number of (n+1) X (2+1) 0..7 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 26.at n=2A233719
• Number of (n+1)X(3+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 26.at n=1A233720
• T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 26 (26 maximizes T(1,1)).at n=7A233724
• T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 26 (26 maximizes T(1,1)).at n=8A233724
• Number of 2n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) n.at n=16A244712
• Number of multiset permutations of {1, 1, 2, 2, ..., n, n} with no fixed pair (j,j).at n=5A374980
• T(n,k) is the number of permutations of the multiset {1, 1, 2, 2, ..., n, n} with k occurrences of fixed pairs (j,j), where T(n,k), n >= 2, 0 <= k <= n-2 is a triangle read by rows.at n=6A375220
• Number A(n,k) of multiset permutations of {{1}^k, {2}^k, ..., {n}^k} with no fixed k-tuple {j}^k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=33A375694