112320

Appears in sequences

• Sum of divisors of superabundant numbers (A004394).at n=22A007626
• Coefficients of replicable function number 12b.at n=17A058490
• A hierarchical sequence (S(W'3{2,2}cc) - see A059126).at n=3A059158
• Sum of divisors of Ramanujan's highly composite numbers, or sigma(A002182(n)).at n=24A063072
• Sum of factorials of digits of n equals the largest prime factor of n.at n=23A074257
• Dimensions of the irreducible representations of the simple Lie algebra of type E6 over the complex numbers, listed in increasing order.at n=26A121737
• a(n) = sigma(lcm(1,2,...,n)) = A000203(A003418(n)).at n=10A124052
• a(n) = sigma(lcm(1,2,...,n)) = A000203(A003418(n)).at n=11A124052
• Number of 8X8 arrays of squares of integers, symmetric under 90 degree rotation, with all rows summing to n.at n=37A156397
• Number of ways to choose n positive integers less than or equal to 2n such that none of the n integers divides another.at n=40A174094
• a(n) = sum of divisors of A094348(n).at n=26A182941
• Subdiagonal partitions: number of partitions (p1, p2, p3, ...) of n with pi <= i.at n=51A238875
• Number m that give records for the quotient between the maximum and minimum x's such that sigma(x)=m.at n=16A241854
• Number of length 3+1 0..2*n arrays with the sum of the absolute values of adjacent differences equal to 3*n.at n=30A249983
• Sum of divisors of the minimal numbers (A007416).at n=46A256259
• Average of amicable pairs (x,y), ordered by the smaller value x given in A002025.at n=13A275315
• Average of amicable pairs (x,y), ordered by the sum x+y given in A259953.at n=13A275316
• Number of nX4 0..1 arrays with no element equal 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=4A281884
• Number of nX5 0..1 arrays with no element equal 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=3A281885
• T(n,k)=Number of nXk 0..1 arrays with no element equal 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=31A281888