73030
domain: N
Appears in sequences
- a(1) = 1; a(n) = Fibonacci(n) - Fibonacci(n-1)* a(n-1) if n > 1.at n=8A079899
- Number of binary strings of length n with no substrings equal to 0001 0010 or 1101.at n=25A164452
- The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n>=1) with exactly k parts (k>=1). Regular triangle read by rows: the rows are indexed by n, the number of vertices of the path, and the columns are indexed by k, the number of parts.at n=58A309748
- Number of length n reversible string structures that are not palindromic using exactly four different colors.at n=10A327611