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.

A004044 The classic football pool problem: size of minimal covering code in {0,1,2}^n with covering radius 1.

Table of values

n	a(n)
0	1
1	1
2	3
3	5
4	9
5	27

List of values

[1, 1, 3, 5, 9, 27]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.