39200

Appears in sequences

• a(n) = 2*binomial(n,3).at n=50A007290
• Number of partitions of n into parts not of the form 17k, 17k+6 or 17k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=43A035967
• Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the six-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).at n=67A079222
• a(n) = the denominator of b(n): {b(n)} is such that the continued fraction (of rational terms) [b(1);b(2),...,b(n)] equals the n-th prime, for every positive integer n.at n=36A128271
• a(n) = -(u^n-1)*(v^n-1) with u = 1+sqrt(2), v = 1-sqrt(2).at n=11A129744
• a(n) = ((n-th prime)^6-(n-th prime^2))/3.at n=3A138442
• Triangle read by rows: T2[n,k] = Sum_{partitions of n with k parts p(n, k; m_1, m_2, m_3, ..., m_n)} c(n; m_1, m_2, ..., m_n) * x_1^m_1 * x_2^m_2 * ... x^n*m_n, where x_i = i-th prime.at n=33A145520
• a(n) = L(n)^2 * F(n+1)^2 * L(n-1) * F(n+2), where F(n) and L(n) are the Fibonacci and Lucas numbers, respectively.at n=4A163196
• Continued fraction expansion for exp( Sum_{n>=1} 1/(n*A003499(n)) ), where A003499(n) = (3+sqrt(8))^n + (3-sqrt(8))^n.at n=11A174501
• Triangle a(n,k) = binomial(n,k)*binomial(n+1,k+1)*binomial(n+2,k+2) read by rows.at n=24A187552
• Number of ways to place n nonattacking composite pieces queen + rider[2,5] on an n X n chessboard.at n=14A189878
• Numbers with prime factorization p^2*q^2*r^5 where p, q, and r are distinct primes.at n=4A190114
• Simple continued fraction expansion of an infinite product.at n=21A221073
• Simple continued fraction expansion of product {k >= 0} (1 - 2*(N - sqrt(N^2-1))^(4*k+3))/(1 - 2*(N - sqrt(N^2-1))^(4*k+1)) at N = 3.at n=11A221193
• The smaller of a pair of successive powerful numbers (A001694) without any prime number between them.at n=19A240591
• a(n) = 32*n^2.at n=35A244082
• Number of (n+2) X (5+2) 0..3 arrays with every 3 X 3 subblock row and column sum equal to 0 2 3 6 or 7 and every 3 X 3 diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=8A252111
• Number of n X 2 0..1 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=8A281982
• T(n,k)=Number of nXk 0..1 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=46A281988
• Triangle T(n,p) read by rows: the order of the semigroup of orientation-preserving partial transformations of n elements with height p.at n=32A289711