A400000 Winners
Web page · https://oeis.org/wiki/A400K_Winners
First seen by Oriel on .
AI summary
The page announces winners, runners-up, and honorable mentions from the OEIS 400k celebration, recognizing inventive sequences across combinatorics, geometry, lattice systems, recurrences, and recreational mathematics.
- A400000 by Eric Fox won for the City-Building sequence, where a(n) is the height of the shortest building seeing exactly h earlier buildings.
- Ten runners-up received newly assigned A-numbers, covering problems involving sums, polyominoes, differences, recurrences, triangle dissections, grids, lattices, and chessboard knights.
- A400003 describes the binary decisions defining a unique infinite path in the base-10 comma child graph, with a simple recurrence established without AI.
- The committee selected ten honorable mentions, including sequences about lattice tessellations, polycubes with cavities, Hasse diagrams, Recamán walks, and Fibonacci-representing quadratic forms.
- The selection committee comprised Sean A. Irvine, Jonas Karlsson, Hugo Pfoertner, and Neil J. A. Sloane, with members abstaining from related evaluations.
#oeis #combinatorics #recreational mathematics #number sequences
Generated by gpt-5.6-sol. Check the original for details.
Metric trends
Last 30 days · Up to 120 recorded samples per source and metric, with reposts kept separate · First and latest retained
Points
Score reported by the source.
- Lobsters: 36, latest observation ; +35 over observed period since
Comments
Comment count reported by the source.
- Lobsters: 4, latest observation ; +4 over observed period since
Aliases
| Source | External ID | URL |
|---|---|---|
| Lobsters | reerrq | https://oeis.org/wiki/A400K_Winners Read discussion |