427680

Appears in sequences

• Table (read by antidiagonals): t(1,n) = t(m,1) = 1 for all m and n. t(m,n) = (sum{k=1 to m-1} t(k,n)) * (sum{k=1 to n-1} t(m,k)).at n=38A124976
• Table (read by antidiagonals): t(1,n) = t(m,1) = 1 for all m and n. t(m,n) = (sum{k=1 to m-1} t(k,n)) * (sum{k=1 to n-1} t(m,k)).at n=42A124976
• a(n) = binomial(n+7,7)*6^n.at n=4A141407
• Number of (n+1)X(1+1) 0..3 arrays colored with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock.at n=3A236199
• T(n,k) = Number of (n+1) X (k+1) 0..3 arrays colored with the maximum plus the upper median minus the lower median minus the minimum of every 2 X 2 subblock.at n=6A236202
• T(n,k) = Number of (n+1) X (k+1) 0..3 arrays colored with the maximum plus the upper median minus the lower median minus the minimum of every 2 X 2 subblock.at n=9A236202
• Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x+k)^k for 0 <= k <= n.at n=61A248826
• A008336(n) is divisible by the product of the primes p such that n/2 <= p < n; a(n) is the quotient.at n=33A370971
• Numbers that have exactly two exponents in their prime factorization that are equal to 5.at n=20A386809