232848

Appears in sequences

• Number of loopless tree-rooted planar maps with 3 vertices and n faces and no isthmuses.at n=20A006428
• The problem of the calissons: number of ways to tile a hexagon of edge n with diamonds of side 1. Also number of plane partitions whose Young diagrams fit inside an n X n X n box.at n=4A008793
• a(n) = Product_{i=1..n} ((i+4)*(i+5)*(i+6)*(i+7))/(i*(i+1)*(i+2)*(i+3)).at n=4A047835
• Number of antichains (or order ideals) in the poset 4*m*n or plane partitions with at most m rows and n columns and entries <= 4.at n=40A056940
• Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A071667/A071668.at n=9A089879
• Square array T(n,k) read by antidiagonals: number of tilings of an <n,k,n> hexagon.at n=32A103905
• Numbers that have exactly ten prime factors counted with multiplicity (A046314) whose digit reversal is different and also has 10 prime factors (with multiplicity).at n=4A109030
• a(n) = (n^2+n^3)*binomial(2*n,n).at n=6A119580
• Triangle of Hankel transforms of certain binomial sums.at n=31A120257
• Triangle of central coefficients of generalized Pascal-Narayana triangles.at n=40A120258
• Structure counts for certain radical benzenoidal structures (see Cash and Dias paper for precise definition).at n=0A128484
• Product of cumulative sums of divisors of n.at n=19A197410
• a(n) = binomial(n,floor(n/2))*binomial(n+1,floor(n/2+1/2))*(1+floor(n/2))/(1+2*floor(n/2)).at n=11A241530
• Numbers with exactly four distinct exponents in their prime factorization, or four distinct parts in their prime signature.at n=14A323025
• Number of permutations of [n] whose cycle minima sum to n.at n=10A368246
• a(n) is the number of secondary GL(4) invariants contructed from n+3 distinct four component vectors.at n=4A383823