390000

Appears in sequences

• a(n) = n*(n-1)^2*(n-2).at n=24A047928
• Smallest oblong (promic) number containing exactly n 0's.at n=3A048530
• Number of 5-ary sequences with primitive period n.at n=8A054720
• Number of primitive (aperiodic) palindromes using a maximum of five different symbols.at n=15A056461
• Jordan function J_4(n).at n=24A059377
• Number of strings of length n over Z_5 with trace 0 and subtrace 1.at n=9A073964
• Number of strings of length n over Z_5 with trace 0 and subtrace 2.at n=9A073965
• Numbers m that raised to the powers from 1 to k (with k>=1) are multiples of the sum of their digits (m raised to k+1 must not be a multiple). Case k=17.at n=2A135202
• Averages of twin primes such that p1*p2 -+ AverageTwinPrime are primes.at n=33A154668
• Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=4A162812
• Oblong numbers that are the product of two oblong numbers.at n=30A188660
• Number of length 8 primitive (=aperiodic or period 8) n-ary words.at n=5A218131
• Number of non-palindromic n-tuples of 5 distinct elements.at n=7A240437
• Numbers n such that there exist three nonnegative integers a,b, and c satisfying n=a*b and (a^2+b^2)/(1+a*b) = c^2.at n=30A268198
• Array read by rows: T(n,k) is the number of solutions to the equation Sum_{i=1..n} x_i^2 == k (mod 5) with x_i in 0..4, where n >= 0 and 0 <= k <= 4.at n=47A330607
• Array read by rows: T(n,k) is the number of solutions to the equation Sum_{i=1..n} x_i^2 == k (mod 5) with x_i in 0..4, where n >= 0 and 0 <= k <= 4.at n=48A330607
• a(n) = n^4 * Sum_{d|n} (-1)^(n/d + 1) * mu(d) / d^4.at n=24A338549