118438

Appears in sequences

• a(n) = 2*a(n-1) + a(floor(n/2)), with a(1) = 1, a(2) = 2, a(3) = 4.at n=16A033497
• a(n) = (-4 + (-2)^n + 2*3^(n+1))/3 - [n=0].at n=10A120656
• Number of sets of nonempty words with a total of n letters over ternary alphabet containing the third letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=10A293884