40500

Appears in sequences

• a(n) = (2*n - 15)*n^2.at n=30A015247
• For n>3: a(n) is a multiple of three distinct earlier terms.at n=20A060301
• Numbers n divisible by exactly five nontrivial permutations (rearrangements) of the digits of n.at n=0A090060
• Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.at n=5A093770
• a(n) = (n+1)^3*(n+2)^2*(n+5).at n=4A109116
• Triangle of numbers related to the spectrum of the hydrogen (H) atom.at n=16A119937
• Second column (n=2) of triangle A119937.at n=4A119941
• Triangle T(n, k) = 0 if BernoulliB(n-k) = 0 otherwise round( binomial(n, k)/BernoulliB(n-k)^k ), read by rows.at n=57A156811
• Numbers k such that the decimal digits of k*(k+1) are a permutation of those of k*(k-1).at n=16A181775
• Floor(1/{(9+n^4)^(1/4)}), where {} = fractional part.at n=44A184633
• G.f.: Sum_{n>=0} (5*n+1)^n * x^n / (1 + (5*n+1)*x)^n.at n=4A187740
• Numbers with prime factorization p^2*q^3*r^4 where p, q, and r are distinct primes.at n=5A190115
• Number of spanning trees in the n-crown graph.at n=2A193133
• Strong Achilles numbers: Achilles numbers m such that phi(m) is also an Achilles number, where phi(m) denotes Euler's totient function of m.at n=19A194085
• n^3 + floor(n^3/2).at n=29A211786
• Number of n-digit numbers that yield an n-digit number after Reverse and Add.at n=4A232729
• Numbers n representable as x*y + x + y, where x >= y > 1, such that all x's and y's in all representation(s) of n are perfect squares.at n=38A258366
• Triangle read by rows: number of spanning trees obtained for an almost-complete bipartite graph by removing k disjoint edges from the complete bipartite graph K n,n with k<=n.at n=14A260383
• First term of A175304 with a given prime signature.at n=34A282231
• a(n) = Product_{d|n, d<n} A260443(d).at n=19A293216