221016
domain: N
Appears in sequences
- Expansion of 1/(1 - 3*x + x^2)^2.at n=10A001871
- Number of 0's in even position in all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword.at n=23A129722
- a(n) = 10*a(n-1) - 22*a(n-2) for n > 1; a(0) = 3, a(1) = 18.at n=6A163471
- Triangle read by rows: T(n,k) is the number of ternary words (i.e., finite sequences of 0's, 1's and 2's) of length n having k occurrences of 01's (0 <= k <= floor(n/2)).at n=43A181371