299833

Appears in sequences

• Numbers k such that k and k^2 use only the digits 2, 3, 7, 8 and 9.at n=7A137092
• Zero-avoiding Fibonacci sequence: a(n) is the largest zeroless number that can be written as a(i) + a(j) where 1 <= i < j < n with a(1) = a(2) = 1.at n=28A374924
• Smallest k such that the sums of digits of k and k^2 in base 10 are both divisible by n or a(n) = -1 if no such k exists.at n=16A389000