776160

Appears in sequences

• Product of first n Catalan numbers.at n=6A003046
• Triangle read by rows: Coefficients of characteristic polynomials of lower triangular matrix of Catalan numbers.at n=26A101413
• Highly abundant numbers (A002093) that are not Harshad numbers (A005349).at n=11A128702
• a(n) = numerator of Product_{k=1..n} k^mu(k), where mu(k) = A008683(k).at n=37A130086
• Weight distribution of [63,30,13] primitive binary BCH code.at n=20A151769
• a(n) = (2*n+1)!*(2*n-2)!/((n-1)!*(n!)^2*6).at n=4A157713
• a(n) = sinh(2*arccosh(n))^2 = 4*n^2*(n^2 - 1).at n=21A173121
• a(n) = Fibonacci(n)*A000143(n) for n>=1 with a(0)=1, where A000143(n) is the number of ways of writing n as a sum of 8 squares.at n=10A205964
• Number of (n+2) X (1+2) 0..2 arrays with every consecutive three elements in every row, column and nw-se diagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=6A252945
• Number of (n+2)X(7+2) 0..2 arrays with every consecutive three elements in every row, column and nw-se diagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=0A252951
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every consecutive three elements in every row, column and nw-se diagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=21A252952
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every consecutive three elements in every row, column and nw-se diagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=27A252952
• Numbers k such that floor(Sum_{d|k} 1 / sigma(d)) = 3.at n=28A265713
• Highly composite numbers of class 2 (see comment in A275239).at n=38A275240
• a(n) = 16*n*(n+1)*(2*n+1)^2.at n=10A322677
• Numbers of the form p^2-1 that have a record-breaking number of divisors, where p is prime.at n=15A323278
• a(n) = n/(Sum_{k=1..n} 1/phi(A341813(n)*k)).at n=34A341814
• The smallest positive integer m such that m mod 2k < k for k = 1, 2, 3, ..., n.at n=27A362532
• The smallest positive integer m such that m mod 2k < k for k = 1, 2, 3, ..., n.at n=28A362532
• The smallest positive integer m such that m mod 2k < k for k = 1, 2, 3, ..., n.at n=29A362532