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.

Showing 1-3 of 3 results.

A332606 Number of triangles in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).

Original entry on oeis.org

14, 48, 102, 192, 326, 524, 802, 1192, 1634, 2296, 3074, 4052, 5246, 6740, 8398, 10440, 12770, 15512, 18782, 22384, 26386, 31204, 36482, 42232, 48826, 56508, 64318, 73356, 83366, 93996, 106010, 118788, 132634, 148600, 164814, 182648, 201998, 223172, 245634
Offset: 1

Views

Author

Scott R. Shannon and N. J. A. Sloane, Mar 12 2020

Keywords

Comments

See A331452 (the illustrations for T(n,2)) for pictures of these graphs.

Links

Crossrefs

Cf. A331452, A331453, A331454, A331763, A331765, A331766, A332599, A332600, A331457, A332607, A332608, A332609.

Extensions

a(21) and beyond from Lars Blomberg, Apr 28 2020

A332607 Number of quadrilaterals in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).

Original entry on oeis.org

2, 8, 36, 92, 194, 336, 554, 812, 1314, 1756, 2508, 3252, 4348, 5464, 7054, 8760, 11050, 13324, 16162, 19256, 23188, 27120, 32098, 37396, 43456, 49516, 57608, 65440, 74670, 84388, 95674, 107656, 120990, 133996, 150144, 166424, 185090, 203960, 224926, 247120
Offset: 1

Views

Author

Scott R. Shannon and N. J. A. Sloane, Mar 12 2020

Keywords

Comments

See A331452 (the illustrations for T(n,2)) for pictures of these graphs.

Links

Crossrefs

Cf. A331452, A331453, A331454, A331763, A331765, A331766, A332599, A332600, A331457, A332606, A332608, A332609.

Extensions

a(21) and beyond from Lars Blomberg, Apr 28 2020

A332609 Maximum number of edges in any cell in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).

Original entry on oeis.org

4, 4, 5, 5, 5, 6, 5, 6, 8, 6, 6, 6, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6
Offset: 1

Views

Author

Scott R. Shannon and N. J. A. Sloane, Mar 12 2020

Keywords

Comments

See A331452 (the illustrations for T(n,2)) for pictures of these graphs.

Links

Crossrefs

Cf. A331452, A331453, A331454, A331763, A331765, A331766, A332599, A332600, A331457, A332606, A332607, A332608.

Extensions

a(21)-a(87) from Lars Blomberg, Apr 28 2020
Showing 1-3 of 3 results.

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

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