230000
domain: N
Appears in sequences
- Numbers divisible by the 4th power of the sum of their digits in base 10.at n=18A072083
- Integers that can be generated with a C/C++ expression that is two or more characters shorter than their decimal representation.at n=22A168651
- Numbers k whose reversal divides the reversal of k+1.at n=27A250602
- a(n) = n*(n + 1)*(n + 2)*(9*n - 7)/12.at n=23A264852
- For any number n > 0, let f(n) be the function that associates k to the prime(k)-adic valuation of n (where prime(k) denotes the k-th prime); f establishes a bijection between the positive numbers and the arithmetic functions with nonnegative integer values and a finite number of nonzero values; let g be the inverse of f; a(n) = g(f(n) * f(n)) (where i * j denotes the Dirichlet convolution of i and j).at n=19A296857
- Number of odd digits necessary to write all nonnegative n-digit integers.at n=4A359271