32032

Appears in sequences

• Number of diagonal dissections of a convex n-gon into n-4 regions.at n=6A002055
• Degrees of irreducible representations of Fischer group Fi22.at n=10A003913
• Number of diagonal dissections of an n-gon into 7 regions.at n=3A033279
• Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.at n=42A033282
• Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 3,2,0.at n=4A037673
• Partial sums of A051880.at n=9A050406
• Tenth unsigned column of Lanczos triangle A053125 (decreasing powers).at n=2A054328
• Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_3^8.at n=7A055764
• G.f.: 1/((1-x^2)^3*(1-x)^4).at n=19A060099
• Numbers whose name in American English is a word-palindrome, reading the same forward and backward.at n=40A081365
• Triangle obtained by adding a leading diagonal 1,0,0,0,... to A033282.at n=52A086810
• Coefficient list of ChebyshevU(n, 1-x).at n=49A100551
• T(n,k) = 2^k*binomial(n,2k+1), where 0 <= k <= floor((n-1)/2), n >= 1.at n=53A105070
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n and having k returns to the x-axis.at n=49A108747
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n and having k returns to the x-axis.at n=48A108747
• a(n) is the least term of the period of the sequence defined by t(1)=n; t(k) = t(k-1)/sod(t(k-1)) if t(k-1) is a multiple of sod(t(k-1)) or t(k-1)*sod(t(k-1)) otherwise, where sod(m)=A007953(m) is the sum of digits of m.at n=50A110731
• a(n) is the least term of the period of the sequence defined by t(1)=n; t(k) = t(k-1)/sod(t(k-1)) if t(k-1) is a multiple of sod(t(k-1)) or t(k-1)*sod(t(k-1)) otherwise, where sod(m)=A007953(m) is the sum of digits of m.at n=33A110731
• Triangle read by rows: T(n,k)=2^k*binomial(2n-k,n-k), 1<=k<=n.at n=39A112326
• Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).at n=50A123519
• Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).at n=38A126216