295639

Appears in sequences

• Smallest composite number n such that every divisor > 1 includes n as a substring.at n=29A105582
• a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2, 1] as of [1, 3, 1].at n=12A211297