29290
domain: N
Appears in sequences
- Number of length 4 1..(n+1) arrays with every leading partial sum divisible by 2, 3 or 5.at n=16A254831
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=35A271150
- G.f. A(x) satisfies: A(x) = 1 + x*A(x^2)/(1 - x)^2.at n=42A307889
- a(n) is the number of words of length n over the alphabet {a,b,c} with an even number of appearances of the letter 'a' and the sum of appearances of the letters 'b' and 'c' add up to at most 3.at n=29A341896