529200

Appears in sequences

• Ratios of successive terms are 1,1,2,3,3,4,5,5,6,7,7,...at n=11A004395
• Number of n X n (real) {0,1}-matrices having determinant A003432(n).at n=6A051752
• Denominator(sum(i=1,n,1/i^5))/denominator(sum(i=1,n,1/i^3)).at n=6A069053
• Denominator of Sum_{k=1..n} phi(k)/k^2.at n=8A072157
• Triangle T(n,k) read by rows, where T(n,k) = number of times the determinant of a real n X n (0,1)-matrix takes the value k, for n >= 0, 0 <= k <= A003432(n).at n=28A089478
• Magic products of 5 X 5 multiplicative magic squares.at n=15A111031
• If (a_n) is a sequence then let L(a_n)=(b_n) where b_n = a_n^2 - a_{n-1} a_{n+1}. The given sequence is the rows of the triangle obtained by computing L^2(binomial(n,k)).at n=38A140982
• Number of n X n (0,1)-matrices with two 1's in each row and permanent equal to 8.at n=6A174638
• Irregular triangle T(n,k) = n!* A036040(n,k), read by rows, 1 <= k <= A000041(n).at n=35A178882
• Irregular triangle T(n,k) = n!* A036040(n,k), read by rows, 1 <= k <= A000041(n).at n=42A178882
• Irregular triangle T(n,k) = n!* A036040(n,k), read by rows, 1 <= k <= A000041(n).at n=40A178882
• Irregular triangle T(n,k) = n!* A036040(n,k), read by rows, 1 <= k <= A000041(n).at n=37A178882
• A Galton triangle: T(n,k) = 2*k*T(n-1,k) + (2*k-1)*T(n-1,k-1).at n=25A187075
• Molecular topological indices of the crossed prism graphs.at n=27A192793
• a(n) = Product_{1 <= i < j <= n} (A018252(i) + A018252(j)); A018252 = nonprime numbers.at n=3A203527
• Triangle T(n,k), 0<=k<=n, given by (0,2,0,4,0,6,0,8,0,10,0,...) DELTA (1, 2, 3, 4, 5, 6, 7, 8, 9,...) where DELTA is the operator defined in A084938.at n=33A211402
• Partition array a(n,k) with the total number of necklaces (C_n symmetry) with n beads, each available in n colors, with color signature given by the k-th partition of n in Abramowitz-Stegun(A-St) order.at n=63A212360
• Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with unicyclic components having exactly k nodes with degree 1; n>=3, 0<=k<=n-3.at n=19A217763
• Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with unicyclic components having exactly k nodes with degree 1; n>=3, 0<=k<=n-3.at n=18A217763
• Area A of the bicentric quadrilaterals such that A, the sides, the radius of the circumcircle and the radius of the incircle are integers.at n=17A219192