122112

Appears in sequences

• Positive numbers n such that n is a multiple of (product of digits of n) * (sum of digits of n).at n=23A049102
• a(n) contains n digits (either '1' or '2') and is divisible by 2^n.at n=5A053312
• Expansion of (1-x)/(1+2*x-2*x^3).at n=25A078060
• Smallest multiple of n^2 beginning and ending in n, or 0 if no such multiple exists.at n=11A078211
• Sorted list of strings that can be obtained by starting with 12 and repeatedly doubling any substring in place.at n=27A130838
• Smallest multiple of 2^n using only 1's and 2's.at n=7A207778
• Smallest multiple of 2^n using only 1's and 2's.at n=8A207778
• Triangle read by rows in which row n lists the binary words of length n over the alphabet {1,2} with no initial repeats.at n=30A211029
• Good's example of a "Standard List" of prime words over the alphabet {1,2}.at n=18A212659
• List of subwords (or factors) of the Thue-Morse "1,2"-word A001285.at n=40A214215
• List of words over {1,2} with equal numbers of 1's and 2's.at n=15A214218
• Words u such that uu is a factor of the Thue-Morse word A001285.at n=8A225188
• a(n) = largest k such that A049820(k) <= A262509(n).at n=25A263083
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 121", based on the 5-celled von Neumann neighborhood.at n=16A285913
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 534", based on the 5-celled von Neumann neighborhood.at n=16A288984
• Consider the Post tag system described in A284116 (but adapted to the alphabet {1,2}) ; sequence lists the words that terminate in the empty word.at n=45A289675
• The decimal expansion of a(n) is the first n terms of A000002.at n=6A329360
• Numbers that are divisible by the square of the product of their digits.at n=24A379984