38102
domain: N
Appears in sequences
- Number of binary strings of length n with no substrings equal to 0001 or 0010.at n=18A164392
- Duplicate of A164392.at n=18A212588
- The total number of nonempty words in all length n finite languages on an alphabet of two letters.at n=10A216158
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 219", based on the 5-celled von Neumann neighborhood.at n=37A270932
- Number of length-n binary words closed by an unbordered word.at n=19A332983