141628

Appears in sequences

• Let S be a string of n 2's and 3's, with curling number k, which means S = XY^k where k is maximized; a(n) = number of S for which X must be taken to be the empty string.at n=37A216951
• Number of strings of length n over a 4-letter alphabet that begin with a nontrivial palindrome.at n=9A249629