80020

Appears in sequences

• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.at n=35A050793
• Number of primes less than 10^n with initial digit 1.at n=6A073517
• Times on a 12-hour digital clock with 6 digits at which the three continuously moving hands of an analog clock, in the best approximation, enclose the same angles with one another, i.e., have the smallest sum of squares of the deviations from 120 degrees. When interpreting the terms as times of the day in the form hh:mm:ss, padding to the left with zeros is assumed.at n=14A347040