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.

A221565 Number of toothpicks or D-toothpicks added at n-th stage to the structure of A220512.

Original entry on oeis.org

0, 4, 8, 16, 16, 16, 28, 48, 32, 16, 32, 64, 64, 80, 84, 112, 64, 16, 32, 64, 96, 112, 144, 176, 136, 112, 96, 176, 176, 208, 196, 240, 128, 16, 32, 64, 96, 112, 152
Offset: 0

Views

Author

Omar E. Pol, May 13 2013

Keywords

Comments

The first differences of A220512.
First differs from A194433 at a(14).

Examples

			When written as a irregular triangle begins:
0;
4;
8;
16,16;
16,28,48,32;
16,32,64,64,80,84,112,64;
16,32,64,96,112,144,176,136,112,96,176,176,208,196,240,128;
16,32,64,96,112,152...
		

Crossrefs

Row lengths give 1 together with A011782. Right border gives 0 together with four times A000079.

A220526 Number of toothpicks and D-toothpicks after n-th stage in the structure of the D-toothpick "medium" triangle of the third kind.

Original entry on oeis.org

0, 1, 3, 7, 11, 15, 19, 26, 34, 38, 42, 50, 62, 76, 88, 103, 119, 123, 127, 135, 147, 163, 183, 207, 233
Offset: 0

Views

Author

Omar E. Pol, Jan 02 2013

Keywords

Comments

The structure is essentially one of the horizontal wedges of A220500. First differs from A194442 (and from A220522) at a(13). A220527 (the first differences) give the number of toothpicks or D-toothpicks added at n-th stage.

Crossrefs

A231346 Number of distinct polygonal shapes after n-th stage in the structure of the D-toothpick cellular automaton of A220500.

Original entry on oeis.org

0, 0, 0, 1, 3, 4, 5, 7, 8, 8, 8, 11, 15, 17, 18, 19, 19, 19, 19, 19, 22
Offset: 1

Views

Author

Omar E. Pol, Dec 07 2013

Keywords

Comments

The cellular automaton of A220500 contains a large number of distinct polygonal shapes. The exact number is unknown. Apparently it's greater than 63.
For simplicity we also call polygonal shapes "polygons".
In order to construct this sequence we use the following rules:
- Consider only the convex polygons and the concave polygons. Self-intersecting polygons are not counted.
- Unfinished polygons with inward growth are not counted.
- If two polygons have the same shape but they have different size then these polygons must be counted as distinct polygonal shapes.
- The reflected shapes of asymmetric polygons, both with the same area, must be counted as distinct polygonal shapes.
Question: Is there a maximal record in this sequence?

Crossrefs

Showing 1-3 of 3 results.