login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319958 Triangle read by rows: T(n,k) (n >= 5, 4 <= k <= n-1) = number of lattice 3-polytopes of width larger than 1, size n, and k vertices. 3
9, 36, 40, 103, 296, 97, 193, 1195, 1140, 147, 282, 2853, 5920, 2491, 152, 478, 5985, 18505, 16384, 3575, 108, 619, 11432, 48103, 64256, 28570, 3425, 59, 858, 18126, 106710, 203600, 138648, 33147, 2333, 21, 1093, 28386, 202579, 523136, 523396, 196635, 26330, 1077, 8, 1410, 42942, 365279, 1168009, 1562709, 880813, 191762, 14235, 367, 2, 1596, 59804, 612700, 2391302, 4030979, 3051531, 1012535, 129149, 5148, 79, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
5,1
LINKS
Mónica Blanco and Francisco Santos, Enumeration of lattice 3-polytopes by their number of lattice points, arXiv:1601.02577 [math.CO], 2016-2017. See Table 2 p. 36.
Mónica Blanco and Francisco Santos, 3d-Polytopes with few lattice points at polyDB, maintained by Andreas Paffenholz.
CROSSREFS
Row sums are A319957.
Sequence in context: A231666 A143224 A192610 * A329808 A169580 A258844
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, Oct 04 2018
EXTENSIONS
Rows 12-15 from polyDB added by Andrey Zabolotskiy, Jan 11 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 08:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)