A075274 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A075274

Number of reachable arrangements of coins in the game Blet starting with 2n coins that achieve the maximum number of heads.

2, 3, 2, 5, 4, 7, 16, 9, 25, 55, 24, 91, 196, 70, 336, 714, 216

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

OFFSET

2,1

COMMENTS

Rodriguez Villegas, Sadun, and Voloch (2002) prove that the maximum number of heads achievable is A047206(n). - Pontus von Brömssen, Mar 08 2025

LINKS

Table of n, a(n) for n=2..18.

Michael S. Branicky, Python program for OEIS A075274

F. Rodriguez Villegas, L. Sadun and J. F. Voloch, Blet: a mathematical puzzle, Amer. Math. Monthly, 109 No.8 (2002), 729-740.

EXAMPLE

For 4 coins, starting from HTHT we can reach THTT, HHTH, TTTH, THHH, and no others. Of these, two arrangements HHTH and THHH achieve the maximum of 3 heads, so a(2) = 2.

PROG

(Python) # see linked program

CROSSREFS

Cf. A047206, A075273, A381812.

Sequence in context: A175856 A075365 A268466 * A331309 A178144 A357987

Adjacent sequences: A075271 A075272 A075273 * A075275 A075276 A075277

KEYWORD

nonn,more,changed

AUTHOR

N. J. A. Sloane, Oct 12 2002

EXTENSIONS

Offset corrected by Michel Marcus, Sep 30 2017

a(16)-a(18) from and name clarified by Sean A. Irvine, Feb 14 2025

STATUS

approved