201000

Appears in sequences

• a(n+1) is the least integer > a(n) containing all digits of a(n); a(1)=2.at n=29A155890
• Number of steps to compute the n-th prime in PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=19A183133
• a(n) = A008412(n-1) + A008412(n-2) for n>1, a(0)=0, a(1)=1.at n=35A287324
• Irregular triangle read by rows: T(n,k) (0 <= k <= n^2) are coefficients of exact wrapping probability for site percolation on an n X n 2D nnsquare lattice with periodic boundary conditions. This is for the probability that it wraps around the vertical dimension.at n=42A366464