110565

Appears in sequences

• Expansion of Product_{k>=0} 1/(1 - x^(k+1))^A001156(k).at n=33A045842
• a(n) = 3^4 * binomial(n+3, 4).at n=11A102741
• a(n) = Product_{k=1..n} sigma(k)/d(k), where sigma(k) = Sum_{j|k} j and d(k) = Sum_{j|k} 1. Set a(n) = 0 if the corresponding product is not an integer (e.g., for n=2 and n=10).at n=10A109361
• Group the triangular numbers so that the n-th group sum is a multiple of n. 1, (3, 6, 10, 15), (21), (28), (36, 45, 55, 66, 78), (91, 105, 120, 136, 153, 171, 190), ... Sequence contains n-th group sum divided by n.at n=31A114032
• Number of 2's in all partitions of 2n that do not contain 1 as a part.at n=26A182716
• Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 3 X n array.at n=38A219774
• Lesser of a pair of amicable numbers k < m such that s(k) = m and s(m) = k, where s(k) = A162296(k) - k is the sum of aliquot divisors of k that have a square factor.at n=6A357495