371025

Appears in sequences

• Generalized Fibonacci numbers: a(n) = a(n-1) + 8*a(n-2).at n=11A015443
• a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2] as of [1, 3].at n=13A211279