110333

Appears in sequences

• a(n) = smallest non-palindromic k such that the base-4 Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A091675(n).at n=6A091677
• Expansion of Product_{k>=1} ((1+x^(3*k-1))*(1+x^(3*k-2)))^k.at n=47A262884
• Triangle read by rows: T(n,k) is the number of length n words over an n-ary alphabet such that the maximal cardinality of C is k, where C is a subset of the alphabet such that all letters in C appear in weakly increasing order within the word.at n=41A387336