88000000

Appears in sequences

• Third binomial transform of Fibonacci(3n)/Fibonacci(3).at n=10A093145
• Numbers k such that k and k^2 use only the digits 0, 3, 4, 7 and 8.at n=15A136933
• Numbers k such that k and k^2 use only the digits 0, 4, 7 and 8.at n=13A136958
• For any number n > 0, let f(n) be the polynomial of a single indeterminate x where the coefficient of x^e is the prime(1+e)-adic valuation of n (where prime(k) denotes the k-th prime); f establishes a bijection between the positive numbers and the polynomials of a single indeterminate x with nonnegative integer coefficients; let g be the inverse of f; a(n) = g(f(n)^2).at n=39A297473