A381813 - OEIS

A381813

Number of connected components, not counting isolated vertices, of the blet graph for n coins.

3, 2, 1, 7, 2, 5, 8, 8, 6, 50, 12, 30, 61, 62, 47, 417, 102, 303, 682, 696, 532

(list; graph; refs; listen; history; text; internal format)

OFFSET

3,1

COMMENTS

The blet graph for n coins has one vertex for each binary heads/tails-sequence of length n. Two vertices are connected by an edge if there is a legal move between them in the game of blet, i.e., if one can be obtained from the other by replacing one occurrence of a triple THT with HTH. The binary sequences are circularly connected, so such a triple is allowed to start at one of the last two elements of the sequence and continue from the beginning.

A075273(n) is the size of the component containing (HT)^n in the blet graph for 2*n coins.

LINKS

Table of n, a(n) for n=3..23.

EXAMPLE

For n = 4, the blet graph has A007039(4) = 6 isolated vertices TTTT, TTHH, THHT, HTTH, HHTT, HHHH, and a(4) = 2 components of size at least 2: {TTTH, THTT, THHH, HTHT, HHTH} and {TTHT, THTH, HTTT, HTHH, HHHT}.

CROSSREFS

Cf. A007039, A075273, A381812, A381814 (size of the largest component).

Sequence in context: A259879 A016556 A067050 * A001355 A364855 A105531

Adjacent sequences: A381796 A381797 A381812 * A381814 A381816 A381817

KEYWORD

nonn,more,new

AUTHOR

Pontus von Brömssen, Mar 08 2025

STATUS

approved