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-9 of 9 results.

A333035 Number of vertices in an equal-armed cross with arms of length n (see Comments in A331456 for definition).

Original entry on oeis.org

5, 69, 397, 1417, 3717, 8009, 15361, 26777, 43697, 67597, 100245, 143177, 199009, 269197, 356789, 464577, 595521, 751129, 935825, 1151881, 1403953, 1695765, 2031485, 2413337, 2848373, 3337781, 3888917, 4505277, 5191557, 5952313, 6796713, 7725945, 8747121
Offset: 0

Views

Author

Keywords

Comments

See the links in A331456 for images of the crosses.

Crossrefs

Cf. A331456 (regions), A333036 (edges), A333037 (n-gons), A092866, A332599, A007569.

Extensions

a(11) and beyond from Lars Blomberg, May 30 2020

A333036 Number of edges in an equal-armed cross with arms of length n (see Comments in A331456 for definition).

Original entry on oeis.org

8, 172, 964, 3316, 8524, 18188, 34540, 59908, 97324, 150028, 221692, 316124, 438364, 592364, 784060, 1019468, 1304996, 1644900, 2047412, 2519172, 3068556, 3704004, 4434044, 5265868, 6211652, 7276492, 8474484, 9813996, 11304292, 12958380, 14791124, 16810732
Offset: 0

Views

Author

Keywords

Comments

See the links in A331456 for images of the crosses.

Crossrefs

Cf. A331456 (regions), A333035 (vertices), A333037 (n-gons), A274586 , A332600, A331765.

Extensions

a(11) and beyond from Lars Blomberg, May 30 2020

A333037 Table read by rows: T(n,k) = number of k-sided polygons in an equal-armed cross with arms of length n (see Comments in A331456 for definition) for k = 3,4,5,6,7.

Original entry on oeis.org

4, 0, 0, 0, 0, 84, 20, 0, 0, 0, 380, 180, 0, 8, 0, 1076, 764, 40, 20, 0, 2380, 2316, 64, 48, 0, 4716, 5188, 224, 52, 0, 8236, 10492, 360, 92, 0, 13620, 18772, 632, 108, 0, 21188, 31380, 864, 196, 0, 31596, 49228, 1376, 224, 8, 44980, 74268, 1920, 272, 8
Offset: 0

Views

Author

Keywords

Comments

See the links in A331456 for images of the crosses.

Examples

			Table begins:
4, 0, 0, 0, 0
84, 20, 0, 0, 0
380, 180, 0, 8, 0
1076, 764, 40, 20, 0
2380, 2316, 64, 48, 0
4716, 5188, 224, 52, 0
8236, 10492, 360, 92, 0
13620, 18772, 632, 108, 0
21188, 31380, 864, 196, 0
31596, 49228, 1376, 224, 8
44980, 74268, 1920, 272, 8
The row sums are A331456.
		

Crossrefs

Cf. A331456 (regions), A333035 (vertices), A333036 (edges), A331451, A332723, A333025.

A331458 a(n) = A331456(n)/4.

Original entry on oeis.org

1, 26, 142, 475, 1202, 2545, 4795, 8283, 13407, 20608, 30362, 43237, 59839, 80792, 106818, 138723, 177369, 223443, 277897, 341823, 416151, 502060, 600640, 713133, 840820, 984678, 1146392, 1327180, 1528184, 1751517, 1998603, 2271197, 2570453, 2898126, 3256414
Offset: 0

Views

Author

N. J. A. Sloane, Jan 30 2020

Keywords

Crossrefs

Cf. A331456.

Extensions

a(6) and beyond from Lars Blomberg, May 30 2020

A337641 One-quarter of the number of regions in the central square of an equal-armed cross with arms of length n (as in A331456).

Original entry on oeis.org

1, 14, 70, 231, 576, 1207, 2255, 3883, 6267, 9588, 14088, 20021, 27667, 37306, 49240, 63859, 81517, 102603, 127545, 156769, 190739, 229932, 274898, 326181, 384332, 449878, 523472, 605766, 697380, 799053, 911449, 1035371, 1171471, 1320566, 1483374, 1660873, 1853819, 2063133, 2289607, 2534326, 2798159
Offset: 0

Views

Author

Keywords

Comments

Without loss of generality, we may assume the central square has vertices (0,0), (1,0), (0,1), (1,1).
Suppose n >= 1. Then all nodes in the graph, whether or not in the central square, have rational coordinates with denominator at most 4*n^2 + 2*n + 1, which for n = 1, 2, 3, ... is 7, 21, 43, 73, 111, ... (cf. A054569).
This maximum is always attained, for example by the node at the intersection of the lines 2*n*x + y = n, joining (0,n) to (1, -n) and -x + (2*n+1)*y = n, joining (-n,0) to (n+1,1).
In the central square, the maximum number of sides in any region is (for n = 0, 1, 2, 3, ...) 3, 4, 6, 6, 6, 6, 6, 6, 6, 7, 7, 6, 6, 6, 6, 6, 7, 6, 7, 7, 6, 6, 6, 6, 6, 6, 6, 7, 7, 6, 6, 6, 6, 6, 6, 6, 7, 7, 6, 6, 6, ... We conjecture that 7 is the maximum. - Lars Blomberg, Sep 19 2020.
See A331456 for further illustrations.

Crossrefs

A331455 Number of regions in a "cross" of width 3 and height n (see Comments for definition).

Original entry on oeis.org

64, 104, 176, 304, 492, 778, 1176, 1732, 2446, 3416, 4614, 6172, 8060, 10340, 13052, 16388, 20228, 24852, 30134, 36206, 43076, 51092, 60010, 70186, 81498, 94180, 108140, 123938, 141074, 160308, 181320, 204328, 229288, 256574, 285856, 318124, 352838, 390338
Offset: 2

Views

Author

Keywords

Comments

This "cross" of height n consists of a vertical column of n >= 2 squares with two additional squares extending to the left and right of the second square. (See illustrations.)
There are n+2 squares in all. The number of vertices is 3*n+2.
Now join every pair of vertices by a line segment, provided the line does not extend beyond the boundary of the cross. The sequence gives the number of regions in the resulting figure.

Crossrefs

Cf. A330848 (n-gons), A330850 (vertices), A330851 (edges).
See A331456 for crosses in which the arms have equal length.
A331452 is a similar sequence for a rectangular region; A007678 for a polygonal region.

Extensions

a(11) and beyond from Lars Blomberg, May 31 2020

A333434 The number of regions inside a diagonal-edged (or diamond-shaped) checkerboard of width and height 2*n-1 formed by the straight line segments mutually connecting any two of the 8*n-4 vertices on the perimeter.

Original entry on oeis.org

4, 104, 1080, 5220, 15508, 39088, 81464, 144292, 261544, 415552, 610460, 942032, 1303848, 1803360, 2461232, 3250284, 4182552, 5269080, 6818764, 8326188, 10336548, 12621292, 14882600, 18368708, 21377496, 25168908, 29994204
Offset: 1

Views

Author

Keywords

Comments

The diagonal-edged checker board of width and height 2*n-1 contains 8*n-4 vertices lying on a 2D square grid as shown in the examples below. Join every pair of vertices by a line segment, provided the line does not extend beyond the boundary of the board. The sequence gives the number of regions in the resulting figure.

Examples

			For n = 1 the board is a single square with 4 vertices on the corners.
For n = 2 the board contains 12 vertices, represented by '*', shown below:
          *---*
          |   |
      *---*   *---*
      |           |
      *---*   *---*
          |   |
          *---*
.
For n = 3 the board contains 20 vertices, represented by '*', shown below:
          *---*
          |   |
      *---*   *---*
      |           |
  *---*           *---*
  |                   |
  *---*           *---*
      |           |
      *---*   *---*
          |   |
          *---*
.
		

Crossrefs

Cf. A333458 (n-gons), A333459 (vertices), A333460 (edges), A331452, A331456, A331911.

Extensions

a(8)-a(27) from Lars Blomberg, Jun 03 2020

A335861 Number of regions in a Y-shaped polygon with equal arms of length n (see the Comments for definition).

Original entry on oeis.org

1, 70, 349, 916, 1474, 2296, 3412, 4978, 7042, 9748, 13132, 17506, 22786, 29410, 37288, 46630, 57574
Offset: 0

Views

Author

Keywords

Comments

This polygon consists of a central equilateral triangle with a line of n adjacent squares connected to each of its three edges. This gives the polygon a total of one triangle, 3n squares, and 6n+3 vertices. Join every pair of vertices by a line segment, provided the line does not extend beyond the boundary of the polygon. The sequence gives the number of regions in the resulting figure.

Examples

			a(0) = 1. There is one region in an equilateral triangle with no other polygons.
a(1) = 70. With one square adjacent to each of the triangles sides the resulting line segments form 48 triangles, twelves 4-gons, nine 5-gons, and one 6-gon. This gives a total of 70 regions. See the first linked image.
		

Crossrefs

Cf. A337790 (number of vertices), A331456, A331452, A306302, A092867, A007678.

A337790 Number of vertices in a Y-shaped polygon with equal arms of length n (see the Comments in A335861 for definition).

Original entry on oeis.org

3, 57, 306, 837, 1335, 2073, 3033, 4395, 6147, 8469, 11253, 14907, 19263, 24819, 31197, 38823, 47619
Offset: 0

Views

Author

Keywords

Comments

See A335861 for a definition of the polygon and images for the number of regions.

Examples

			a(0) = 3. A single triangle with no other polygons has three vertices.
a(1) = 57. With one square adjacent to each of the triangles sides the resulting line segments form 51 vertices shared by four polygons, 3 vertices shared by six polygons, and 3 vertices shared by seven polygons. This gives a total of 57 vertices. See the first linked image.
		

Crossrefs

Cf. A335861 (number of regions), A331456, A331452, A306302, A092867, A007678.
Showing 1-9 of 9 results.