211121

Appears in sequences

• Fibonacci numbers written in base 3.at n=15A004686
• A monotonic doubly-fractal simple sequence. Erase the last (rightmost) digit of every integer: what is left is the sequence itself. The erased digits, one by one, form also the sequence itself.at n=11A127199
• Positive numbers n such that (digitsum(n))^2 equals (product of digits(n))^3.at n=17A261778
• Number of nX3 0..3 arrays with no three equal values forming an isosceles triangle, and new values introduced in 0..3 order.at n=4A273966
• T(n,k)=Number of nXk 0..3 arrays with no three equal values forming an isosceles triangle, and new values introduced in 0..3 order.at n=23A273968
• T(n,k)=Number of nXk 0..3 arrays with no three equal values forming an isosceles triangle, and new values introduced in 0..3 order.at n=25A273968
• a(n) = Fibonacci(n) represented in bijective base-3 numeration.at n=14A282234
• Number of nX4 0..1 arrays with every element unequal to 2 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=15A303632
• Unique representation of nonnegative numbers by iterated tribonacci A, B and C sequences.at n=25A316713
• List of Nyldon words over {1,2}.at n=16A328073