55550

Appears in sequences

• Numbers having four 5's in base 10.at n=20A043512
• Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive).at n=40A074814
• a(n) = number of solutions to the Diophantine equation x+y^2+z^3=n^4 with positive x,y,z all distinct.at n=27A121984
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 5 and 8.at n=36A136890
• Numbers whose decimal expansion contains only 0's and 5's.at n=30A169964
• Numbers in which each digit equals the sum (mod 10) of the other digits.at n=22A226468
• For k in {2,3,...,9} define a sequence as follows: a(0)=0; for n>=0, a(n+1)=a(n)+1, unless a(n) ends in k, in which case a(n+1) is obtained by replacing the last digit of a(n) with the digit(s) of k^2. This is k(7).at n=36A237344
• Consider a decimal number of k>=2 digits x = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + ... + d_(2)*10 + d_(1) and the transform T(x)-> (d_(k)+d_(k-1) mod 10)*10^(k-1) + (d_(k-1)+d_(k-2) mod 10)*10^(k-2) + ... + (d_(2)+d_(1) mod 10)*10 + (d_(1)+d(k) mod 10). Sequence lists the numbers x such that T(x) divides x.at n=18A244286
• a(0) = a(1) = 1; for n > 1, a(n) = Sum_{k=0..n-2} a(k) OR a(n-k-2).at n=18A318621