112000

Appears in sequences

• arcsin(sec(x)*arctan(x))=x+2/3!*x^3+48/5!*x^5+1080/7!*x^7+112000/9!*x^9...at n=4A012803
• Numbers n with property that n is a substring of its base 4 representation.at n=8A038104
• Number of connected planar graphs with n edges.at n=13A046091
• Numbers k such that core(k) = b(k,1)*b(k,0) where b(k,1) is the number of 1's in binary representation of k, b(k,0) the number of 0's and core(k) the squarefree part of k.at n=11A071639
• Least k such that Sum_{i=1..k} gcd(k,i) = n * sigma(k).at n=9A072108
• Sum of factorials of digits of n equals the largest prime factor of n.at n=22A074257
• Icosagonal numbers divisible by 20.at n=23A117798
• Totally multiplicative sequence with a(p) = 10*(p+2) for prime p.at n=19A167311
• Denominators of the coefficients in g.f. A(x) such that: sn(x,i*A(x)) = x, where i^2 = -1, and sn(x,k) is a Jacobi elliptic function.at n=4A279833
• Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic residues mod p that are > p/2.at n=36A282722
• Irregular triangle read by rows where T(n,k) is the number of (d + 1)-uniform hypertrees spanning n + 1 vertices, where d = A027750(n,k).at n=21A326374
• Numbers whose k digits can be permuted into a new k-digit number according to rules explained in the Comments section.at n=14A330418
• Irregular triangle T(n,k) read by rows in which n-th row lists in colex order all series-reduced tree degree sequences D of n nodes encoded as t = Product_{d in D} prime(d); n >= 4, 1 <= k <= A002865(n-2).at n=28A345970
• Numbers k >= 1 such that A018804(k) divided by A000203(k) is an integer.at n=36A349726
• Ternary numbers consisting of a run of 1's, then a run of 2's, then a run of 0's.at n=13A371051
• Ternary numbers that are concatenated runs A(1)C(1)B(1)A(2)C(2)B(2)...A(k)C(k)B(k), where A(i) is a run of 1's, B(i) a run of 0's, and C(i) a run of 2's, for i = 1..k.at n=13A371107
• a(n) = [x^n] Product_{k=1..n} ((1 + k*x)/(1 - k*x))^2.at n=4A384086