1000000000

Appears in sequences

• Number of labeled rooted trees with n nodes: n^(n-1).at n=9A000169
• Ninth powers: a(n) = n^9.at n=10A001017
• Cubes written in base 2.at n=7A004632
• Cubes written in base 3.at n=26A004633
• Powers of 2 written in base 4.at n=18A004643
• Powers of 2 written in base 8.at n=27A004647
• Powers of 2 written in base 16.at n=36A004655
• Powers of 3 written in base 9.at n=18A004663
• Powers of 3 written in base 27.at n=27A004669
• The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=23A007924
• Powers of 10: a(n) = 10^n.at n=9A011557
• a(n) = 10^(2*n+1).at n=4A013715
• a(n) = 10^(4*n + 1).at n=2A013792
• a(n) = 10^(5*n + 4).at n=1A013857
• a(n) = (2*n)^9.at n=5A016749
• a(n) = (3*n + 1)^9.at n=3A016785
• a(n) = (4n+2)^9.at n=2A016833
• a(n) = (5n)^9.at n=2A016857
• a(n) = (6*n + 4)^9.at n=1A016965
• a(n) = (7*n + 3)^9.at n=1A017025