1600001

Appears in sequences

• Starting at the integer 0, add one of each base-n digit in base n to a pile and then take from this pile the digits required to construct the current integer. Continue consecutively until reaching an integer, a(n), that requires digits not in the pile.at n=8A092955
• Fibonacci sequence beginning 10, 7.at n=26A190996
• Number of partitions of n^5 into at most two parts.at n=20A274325