137200

Appears in sequences

• Expansion of (theta_3(z)*theta_3(11z) + theta_2(z)*theta_2(11z))^4.at n=41A028612
• Sums of 4 distinct powers of 7.at n=34A038483
• a(n)=n^2 times nearest cube to n^2.at n=20A077112
• a(0) = 1, a(n) = 20*sigma[3](n).at n=19A091983
• Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.at n=19A093770
• a(n) = floor(1/{(10+n^4)^(1/4)}), where {}=fractional part.at n=69A184634
• Numbers with prime factorization p^2*q^3*r^4 where p, q, and r are distinct primes.at n=16A190115
• a(0)=0, a(1)=1, a(2n)=19*a(n), a(2n+1)=a(2n)+1.at n=27A197353
• Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape U; triangle T(n,k), n>=0, read by rows.at n=17A247708
• Number of tilings of a 5 X n rectangle using n pentominoes of any but the U shape.at n=7A247772
• a(n) = (3*n+7)*n^2.at n=35A257042
• Numbers k such that both k and sigma(k)=A000203(k) are powerful, i.e., are terms of A001694.at n=7A337044
• Square array A(n, k) = A064987(A246278(n, k)), read by falling antidiagonals; A064987(n) = n*sigma(n), applied to the prime shift array.at n=24A379499
• Square array A(n, k) = A249670(A246278(n, k)), read by falling antidiagonals; A249670(n) = A017665(n)*A017666(n), applied to the prime shift array.at n=24A379500
• a(n) = sigma_1(n) * sigma_3(n).at n=18A379813
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = -4.at n=16A380925