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.

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

This page as a plain text file.
%I A290648 #15 Aug 18 2017 09:58:09
%S A290648 6,12,14,16,18,19,18,20,22,23,22
%N A290648 a(n) is the smallest number of faces of the triangular lattice required to enclose an area consisting of exactly n faces.
%F A290648 Conjecture: a(n) = 2*A067628(n) + 6.
%Y A290648 Triangular version of A235382.
%K A290648 nonn,more
%O A290648 0,1
%A A290648 _Christian Majenz_, Aug 08 2017