102136

Appears in sequences

• Number of ways writing n^n as a product of decimal digits of some other number which has no digits equal to 1.at n=5A068185
• a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.at n=36A070902
• a(n) = concatenation of (n times each digit of n).at n=33A111704
• Start with a single pentagon; at n-th generation add a pentagon at each expandable vertex; a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)at n=23A247619