33005

Appears in sequences

• Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 5 sites wide.at n=36A058368
• Start with a(1) = 1, a(2) = 1, then a(n)*3^k = a(n+1) + a(n+2), with 3^k the smallest power of 3 (k>0) such that all terms a(n) are positive integers.at n=24A233525
• a(n) = 24*n^2 + 52*n + 29.at n=36A258721
• 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=36A270932
• Number of maximal independent vertex sets (and minimal vertex covers) in the n-wheel graph.at n=34A290612