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.

User: Christian Majenz

Christian Majenz's wiki page.

Christian Majenz has authored 1 sequences.

A290648 a(n) is the smallest number of faces of the triangular lattice required to enclose an area consisting of exactly n faces.

Original entry on oeis.org

6, 12, 14, 16, 18, 19, 18, 20, 22, 23, 22
Offset: 0

Views

Author

Christian Majenz, Aug 08 2017

Keywords

Crossrefs

Triangular version of A235382.

Formula

Conjecture: a(n) = 2*A067628(n) + 6.

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

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