128700

Appears in sequences

• Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_8^3.at n=8A055759
• a(n) = n!/A093888(n).at n=13A093889
• Triangle read by rows: number of order-preserving partial transformations (of an n-element chain) of width and waist both equal to r (width(alpha) = |Dom(alpha)| and waist(alpha) = max(Im(alpha))).at n=64A110858
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=11.at n=23A135196
• a(n) = 10*a(n-1) + 10*a(n-2), with a(0)=1, a(1)=9, a(2)=99.at n=5A155157
• Numbers with prime factorization pqr^2s^2t^2.at n=6A190379
• Number of (n+1) X 2 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.at n=7A207043
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=28A207050
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=35A207050
• Integer areas of integer-sided triangles where two sides are of square length.at n=33A232461
• T(n,k) = number of linear arrays of n 1's, n -1's, and k 0's such that no two adjacent elements are equal.at n=88A283613
• a(n) = Product_{d|n} A019565(d)^[moebius(n/d) = -1].at n=65A300832
• Regular triangle T(n,k) = binomial(2*n-2*k,n-k)*((n+1)/k)*Sum_{k=0..floor((k-1)/2)} (-1)^k*binomial(2*k,k)*binomial(n+3*k-2*k,k-2*k-1), read by rows.at n=36A306625
• a(1) = 1; for n > 1, a(n) = Product_{d|n} A019565(d)^[moebius(d) = +1].at n=65A320017
• Consider primitive pairs of integers (b, c) with b > 0 such that x^5 + b*x + c = 0 is irreducible and solvable by radicals: sequence gives values of c.at n=14A371554
• Consider primitive pairs of integers (b, c) with b > 0 such that x^5 + b*x + c = 0 is irreducible and solvable by radicals: sequence gives values of c.at n=25A371554