100000000010
domain: N
Appears in sequences
- a(1) = 1, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=20A077712
- Inverse Moebius transform of powers of 10.at n=11A113705
- Not of the form n + [log_10 n].at n=11A123522
- a(n) = n + n*n^n.at n=9A322406
- a(n) = Sum_{k=1..n} phi(gcd(k, n))^n.at n=10A342539
- a(n) = Sum_{k=1..n} phi(gcd(k, n))^gcd(k, n).at n=10A342543
- a(n) is obtained by replacing 2's by n's in the hereditary base-2 expansion of n.at n=10A343255