50460

Appears in sequences

• sec(log(cos(x)))= 1+3/4!*x^4+30/6!*x^6+1113/8!*x^8+50460/10!*x^10...at n=5A012008
• Number of partitions of n with no part larger than n/2. Also partitions of n into n/2 or fewer parts.at n=42A110618
• Numbers k such that 1*k + 1, 3*k + 1, 9*k + 1, 27*k + 1 are all primes.at n=36A112041
• Averages of twin primes such that the sum of the lower, average and upper parts of the twin primes are averages of other twin primes.at n=20A132929
• a(n) = A008893(n)/2.at n=15A152041
• Molecular topological indices of the complete graph K_n.at n=29A181617
• Number of partitions of 2n in which every part is <n+1; also, the number of partitions of 2 into rational numbers a/b such that 0<a<=b<=n and b divides n.at n=20A209816
• Number of (n+6)X11 0..1 matrices with each 7X7 subblock idempotent.at n=9A224585
• Integer areas of integer-sided triangles such that the length of two sides are Fibonacci numbers.at n=15A236539
• Number of partitions of n with difference 4 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=47A242695
• a(n) = A324484(n)/n.at n=13A324485
• Number of integer partitions of n whose greatest part is at most one more than the sum of the other parts.at n=42A336106
• Irregular triangular array read by rows. Let S_n be the set of labeled graphs G on [n] with 2-colored nodes where black nodes are only connected to white nodes and vice versa. Orient the edges in each such graph G from black to white. T(n,k) is the number of graphs in S_n containing exactly k descents, n>=0, 0<=k<=A002620(n).at n=30A381058