10000000
domain: N
Appears in sequences
- Numbers written in base of triangular numbers.at n=35A000462
- Seventh powers: a(n) = n^7.at n=10A001015
- Powers of 2 written in base 4.at n=14A004643
- Powers of 2 written in base 8.at n=21A004647
- Powers of 2 written in base 16.at n=28A004655
- Powers of 3 written in base 9.at n=14A004663
- Powers of 3 written in base 27.at n=21A004669
- a(n) = (n+3)^n.at n=7A007830
- The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=17A007924
- a(n) = floor(n/2)^floor(n/3).at n=19A010765
- Powers of 10: a(n) = 10^n.at n=7A011557
- Triangle of coefficients in expansion of (1+10x)^n.at n=35A013617
- a(n) = 10^(2*n+1).at n=3A013715
- a(n) = 10^(3*n + 1).at n=2A013746
- a(n) = 10^(4*n + 3).at n=1A013793
- a(n) = 10^(5*n + 2).at n=1A013855
- Numbers k such that k^2 contains exactly 2 distinct digits.at n=39A016069
- a(n) = (2*n)^7.at n=5A016747
- a(n) = (3*n+1)^7.at n=3A016783
- a(n) = (4n+2)^7.at n=2A016831