50505

Appears in sequences

• Numbers that are palindromic and divisible by 5.at n=28A043040
• Composite palindromes divisible by the sum of their prime factors (counted with multiplicity).at n=7A046348
• Odd numbers with exactly 5 distinct prime factors.at n=20A046391
• Palindromes that are the product of 5 distinct primes.at n=6A046395
• Numbers whose consecutive digits differ by 5.at n=41A048407
• a(n) = (2*n+1)*(2*n+3)*(2*n+5).at n=17A061550
• Smallest multiple of n using only digits 0 and 5.at n=20A078244
• Smallest n-digit multiple of n in which the even-numbered digits are all equal and the odd-numbered digits are all equal, or 0 if no such number exists.at n=4A078252
• Odd squarefree abundant numbers.at n=17A112643
• Odd unitary abundant numbers.at n=17A129485
• a(n) = (4*n+3)*(4*n+5)*(4*n+7).at n=8A133767
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 5 and 7.at n=24A136889
• Numbers k such that k and k^2 use only the digits 0, 2, 5 and 7.at n=14A136915
• Numbers k such that k and k^2 use only the digits 0, 2, 5, 7 and 8.at n=25A136916
• Numbers k such that k and k^2 use only the digits 0, 2, 5, 7 and 9.at n=42A136917
• Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) is not coefficient convex.at n=31A146960
• a(n) = (n-5)*(n-6)*(n-7)*(n-16)/24.at n=34A167543
• Numbers whose decimal expansion contains only 0's and 5's.at n=21A169964
• Number of simple labeled graphs on n nodes of degree 1 or 2 without cycles.at n=8A185369
• a(n) = 12spt(n) + (24n - 1)p(n), with a(0) = -1.at n=14A220481