31740

Appears in sequences

• T(n,k) counts ordered complete ternary trees with 2*n-1 leaves having k internal vertices colored black, the remaining n-1-k internal vertices colored white, and such that each vertex and its rightmost child have different colors.at n=38A196201
• T(n,k) counts ordered complete ternary trees with 2*n-1 leaves having k internal vertices colored black, the remaining n-1-k internal vertices colored white, and such that each vertex and its rightmost child have different colors.at n=42A196201
• Number of (n+1)X(3+1) 0..4 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 12.at n=3A234109
• Number of (n+1)X(4+1) 0..4 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 12.at n=2A234110
• T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 12.at n=17A234114
• T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 12.at n=18A234114
• Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of normalized 2n-plets associated to trees with k edges.at n=47A294439
• Numbers k such that 3*10^k - 13 is prime.at n=20A295327
• Triangle read by rows: Number of walks from (0,0) to (3n,3k) on the square lattice with up and right steps where squares (x,y)=(1,1) mod 3 or (x,y)=(2,2) mod 3 are not entered.at n=40A348595
• Consecutive states of the linear congruential pseudo-random number generator for Smalltalk-80 when started at 1.at n=27A384220
• Number of integer partitions of n such that the least part plus the greatest part is odd.at n=42A390092