37680

Appears in sequences

• Numbers n such that sigma(n) is congruent to n mod phi(n).at n=18A066679
• Smallest solution to x+n*phi(x) = sigma(x) = x+n*A000010(x) = A000203(x).at n=7A076374
• 2n is equal to the sum of its divisors after the digits have been sorted in descending order (zeros dropped).at n=5A083373
• Triangle read by rows: T(n,k) = a(k)*binomial(n,k) (0 <= k <= n), where a(0)=1, a(1)=2, a(k) = a(k-1) + 3*a(k-2) for k >= 2 (a(k) = A006138(k)).at n=62A124959
• Number of compositions of n where differences between neighboring parts are in {-2,0,2}.at n=28A214253
• Number of n X 5 0..1 arrays with every row least squares fitting to a positive-slope straight line and every column least squares fitting to a zero- or positive-slope straight line, with a single point array taken as having zero slope.at n=4A222966
• Table T(n,k) is the number of n X (k+1) 0..1 arrays with every row least squares fitting to a positive-slope straight line and every column least squares fitting to a zero- or positive-slope straight line, with a single point array taken as having zero slope, read by downward antidiagonals.at n=32A222969
• Number of 5 X (n+1) 0..1 arrays with every row least squares fitting to a positive-slope straight line and every column least squares fitting to a zero- or positive-slope straight line, with a single point array taken as having zero slope.at n=3A222973
• Smallest number k such that prime(n) divides the n-th divisor of k.at n=35A226101
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 449", based on the 5-celled von Neumann neighborhood.at n=39A272254
• Expansion of 1/(1 - Sum_{k>=0} x^(3*k*(k+1)/2+1)).at n=33A282502
• Expansion of Product_{k>=1} ((1 - x^k)/(1 + x^k))^(sigma_2(k)).at n=14A320972
• Weight multiplicities for the trivial representation of the Lie algebra E_8.at n=14A340522
• a(n) is the number of different (n-1)-move routes for a king on an empty n X n chessboard.at n=4A355127