90132

Appears in sequences

• Number of self-avoiding paths with n steps on a triangular lattice in the strip Z x {0,1}.at n=13A100691
• a(n) = n*(n+1)*(11*n +10)/6.at n=36A254407
• a(n) is the smallest positive integer not yet in the increasing sequence that is obtained when the largest digit from a(n-1) is deleted and the remaining digits are permuted such that no digit in a(n) has the same position it had in a(n-1) (counting from left to right). No repeated digits allowed; a(1)=10.at n=24A302095
• G.f. A(x) satisfies A(x) = ( 1 + x*A(x)^(4/3)/(1 + x*A(x)^(1/3)) )^3.at n=7A378889