90575

Appears in sequences

• a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 2] as of [3, 1, 3].at n=11A211296
• Number k such that k^2 + 1 = p*q*r where p,q,r are distinct primes and the sum p+q+r is a perfect square.at n=23A261529
• Index in A353715 of the first term divisible by 2^n and no higher power of 2, or -1 if no such term exists.at n=11A353727