59400

Appears in sequences

• Numbers k such that phi(k) + sigma(k) = 4*k.at n=1A011254
• Nonprimes k that divide sigma(k) + phi(k).at n=6A011774
• Cusp form of weight 13/2 associated to the unique cusp form of weight 12 under Shimura correspondence.at n=44A054891
• There exists some k>0 such that n is the product of (k + digits of n).at n=21A055482
• Numbers k such that k | sigma_9(k) - phi(k)^9.at n=40A055703
• Triangle of numbers used for basis change between certain falling factorials.at n=19A089503
• Numbers n such that n=(d_1+6)*(d_2+6)*...*(d_k+6) where d_1 d_2 ... d_k is the decimal expansion of n.at n=3A097372
• Numbers n>9 such that n=Abs[(c+d_1)*(c+d_2)*...*(c+d_k)] where d_1 d_2 ... d_k is the decimal expansion of n and c is an integer constant.at n=40A113756
• Triangle of unsigned 4-Lah numbers.at n=16A143499
• Numbers with prime factorization pq^2r^3s^3.at n=2A190320
• Triangular array: T(n,k) = sqrt(C(n-1,k-1)*C(n-1,k)*C(n,k+1)* C(n+1,k+1)*C(n+1,k)*C(n,k-1)), where C(n,k) = binomial(n,k).at n=37A197208
• Triangular array: T(n,k) = sqrt(C(n-1,k-1)*C(n-1,k)*C(n,k+1)* C(n+1,k+1)*C(n+1,k)*C(n,k-1)), where C(n,k) = binomial(n,k).at n=43A197208
• Number of all self-avoiding planar walks of length j (0<=j<=n) starting at (0,0), ending at (n-j,0), remaining in the first quadrant and using steps (0,1), (1,0), (1,1), (-1,1), and (1,-1) with the restriction that (0,1) is never used below the diagonal and (1,0) is never used above the diagonal.at n=22A284428
• Smallest integer such that the sum of its n smallest divisors is a Fibonacci number, or 0 if no such integer exists.at n=37A292467
• Numbers k that are divisible by sum(pi)^2+sum(ei) where k=p1^e1*...*pj^ej with pi primes.at n=40A321456
• Sequence lists numbers k > 1 such that k^2 == phi(k) (mod sigma(k)), where phi = A000010 and sigma = A000203.at n=25A324214
• Consider all 3 X 3 matrices M whose entries are the n-th to (n+8)-th primes prime(n), ..., prime(n+8), in any order. a(n) is the sum of the number of M such that det(M) is divisible by prime(n+i), for i from 0 to 8.at n=11A339105
• Coreful 3-abundant numbers: numbers k such that csigma(k) > 3*k, where csigma(k) is the sum of the coreful divisors of k (A057723).at n=20A340109
• Number of ways to write n as an ordered sum of 10 nonzero triangular numbers.at n=33A340955
• Numbers k such that A051709(k)/A173557(k) is a positive natural number and a divisor of k.at n=26A344995