120000

Appears in sequences

• Number of Pythagorean quintuples mod n; i.e., number of solutions to v^2 + w^2 + x^2 + y^2 = z^2 mod n.at n=19A096020
• Times in hours,minutes and seconds (to the nearest second) at which the smoothly crossing minute and hour hands of an analog clock coincide, over a period of one complete 12-hour sweep of the hour hand.at n=11A120500
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=12.at n=28A135197
• An eighth of the product of three integers surrounding the (n+1)-st prime, minus half of the product of the 3 numbers surrounding n+1.at n=24A141535
• a(n+1) is the least integer > a(n) containing all digits of a(n); a(1)=2.at n=25A155890
• If p and q are twin primes then pq + 1 is always divisible by 3, except for (p,q)=(3,5). Sequence gives values of (pq + 1)/3.at n=25A165280
• Totally multiplicative sequence with a(p) = 2*(p+3) for prime p.at n=47A167321
• Integers that can be generated with a C/C++ expression that is two or more characters shorter than their decimal representation.at n=11A168651
• Number of (n+2) X 6 binary arrays avoiding patterns 001 and 110 in rows and columns.at n=7A202048
• Number of shapes of balanced 10-ary trees with n nodes, where a tree is balanced if the total number of nodes in subtrees corresponding to the branches of any node differ by at most one.at n=14A229395
• Numbers which divide the concatenation, in ascending order, of their anti-divisors.at n=36A249764
• Lexicographically least strictly increasing sequence such that, for any n>0, Sum_{k=1..n} a(k) can be computed without carries in base 10.at n=22A278742
• Expansion of Product_{k>=1} 1/(1 - x^(k*(k+1)/2))^(k*(k+1)/2).at n=37A298730
• Polydivisible nonnegative integers whose decimal digits span an initial interval of {0,...,9}.at n=14A305712
• Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 10 * T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=52A317054
• Times on a 12-hour digital clock with 6 digits at which the angle of the sector enclosing the three continuously moving hands of an analog clock has a local minimum.at n=11A348758
• Numbers m such that the smallest digit in the decimal expansion of 1/m is 3, ignoring leading and trailing 0's.at n=36A352157
• a(n) is the smallest integer that has exactly n odious divisors (A227872) and n evil divisors (A356018).at n=34A356040
• Ternary numbers consisting of a run of 1's, then a run of 2's, then a run of 0's.at n=16A371051
• Ternary numbers that are concatenated runs A(1)C(1)B(1)A(2)C(2)B(2)...A(k)C(k)B(k), where A(i) is a run of 1's, B(i) a run of 0's, and C(i) a run of 2's, for i = 1..k.at n=16A371107