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.

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

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Oct 12 2002

Keywords

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

Examples

			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.
		

Crossrefs

Programs

  • Python
    # see linked program

Extensions

Offset corrected by Michel Marcus, Sep 30 2017
a(16)-a(18) from and name clarified by Sean A. Irvine, Feb 14 2025