cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A066346 Number of winning binary "same game" templates with ternary digits totaling n.

Original entry on oeis.org

1, 0, 1, 0, 2, 2, 4, 9, 13, 28, 46, 84, 146, 252, 433, 736, 1242, 2087, 3482, 5791, 9587, 15823, 26038, 42743, 70016, 114485, 186903, 304728, 496260, 807395, 1312504, 2132102, 3461407, 5616609, 9109732
Offset: 0

Views

Author

Frank Ellermann, Dec 23 2001

Keywords

Comments

Equivalently, templates whose minimum matching string has length n.

Examples

			a(1)..a(5) correspond to the winning templates -;2;-; 121,22; 122,221.
a(6) = 4 winning templates 11211,1212,2121 and 222 have a total of 6.
		

Crossrefs

Cf. A066345 (definition), A007931 (templates). A035615 (binary same game).

Extensions

a(17)-a(35) from Sean A. Irvine, Oct 09 2023