100053

Appears in sequences

• a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 5) so far).at n=38A060732
• Numbers such that the digital sums in bases 2, 3, 5 and 10 all are equal.at n=15A135128
• Number of times the digit 5 appears in the first 10^n digits of Catalan's constant.at n=5A224774
• Lagged Fibonacci Generator: a(n) = (100003 - 200003*n + 300007*n^3) mod 10^6 for n <= 55, a(n) = (a(n-24) + a(n-55)) mod 10^6.at n=1A380292