496125
domain: N
Appears in sequences
- -sinh(log(x+1)-arctanh(x)) = 1/2!*x^2 + 6/4!*x^4 + 135/6!*x^6 + 6300/8!*x^8 + ...at n=4A013299
- Factorial splitting: write n! = x*y*z with x<y<z and x maximal and z is minimal; sequence gives value of y.at n=16A061031
- Odd nonunitary abundant numbers.at n=9A094889
- Triangular array read by rows: e.g.f. sqrt(1-z^2)*exp(x*z)/(1+z).at n=57A138022
- Triangular array read by rows. Row n lists the coefficients of the closed form of hypergeometric([1/2, -n/2, (1-n)/2], [], 4*z).at n=31A246256
- Number of 2 X 2 matrices having all elements in {-n,..,0,..,n} with determinant = permanent.at n=31A280059
- Number of nX6 0..1 arrays with every element unequal to 0, 1, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=6A316237
- Number of n X 7 0..1 arrays with every element unequal to 0, 1, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=5A316238
- Numbers whose ordered prime signature is equal to the set of distinct prime indices in decreasing order.at n=37A324571
- a(n) = ((p-1)^3 - (p-1)^2)/4 where p is the n-th prime.at n=30A331764
- Odd coreful abundant numbers: the odd terms of A308053.at n=4A339936
- Odd numbers k such that A187795(k) > 2*k.at n=9A347936
- Primitive terms of A347936: terms of A347936 that are not multiples of other terms of A347936.at n=8A347939
- Factorial splitting: write n! = x*y*z with x <= y <= z and minimal z-x; sequence gives value of y.at n=19A355190
- Triangle read by rows: T(m,n) is the number of spanning trees in the graph whose nodes are the integer lattice points (x,y) with 0 <= x < m and 0 <= y < n, and with an edge between two nodes if there is no other integer lattice point on the line segment between them; 1 <= n <= m.at n=5A360062
- Positive integers k = p_1^e_1*p_2^e_2*p_3^e_3, such that the points (p_1, e_1), (p_2, e_2) and (p_3, e_3) lie on a straight line with nonzero slope.at n=18A389340