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.

A161330 Snowflake (or E-toothpick) sequence (see Comments lines for definition).

Original entry on oeis.org

0, 2, 8, 14, 20, 38, 44, 62, 80, 98, 128, 146, 176, 218, 224, 242, 260, 290, 344, 374, 452, 494, 548, 626, 668, 734, 812, 830, 872, 914, 968, 1058, 1124, 1250, 1340, 1430, 1532, 1598, 1676, 1766, 1856, 1946, 2000, 2066, 2180, 2258, 2384, 2510, 2612, 2714, 2852, 2954, 3116, 3218, 3332, 3494, 3620, 3782, 3896, 3998, 4100
Offset: 0

Views

Author

Omar E. Pol, Jun 07 2009

Keywords

Comments

This sequence is an E-toothpick sequence (cf. A161328) but starting with two back-to-back E-toothpicks.
On the infinite triangular grid, we start at round 0 with no E-toothpicks.
At round 1 we place two back-to-back E-toothpicks, forming a star with six endpoints.
At round 2 we add six more E-toothpicks.
At round 3 we add six more E-toothpicks.
And so on ... (see the illustrations).
The rule for adding new E-toothpicks is as follows. Each E has three ends, which initially are free. If the ends of two E's meet, those ends are no longer free. To go from round n to round n+1, we add an E-toothpick at each free end (extending that end in the direction it is pointing), subject to the condition that no end of any new E can touch any end of an existing E from round n or earlier. (Two new E's are allowed to touch.)
The sequence gives the number of E-toothpicks in the structure after n rounds. A161331 (the first differences) gives the number added at the n-th round.
See the entry A139250 for more information about the toothpick process and the toothpick propagation.
Note that, on the infinite triangular grid, a E-toothpick can be represented as a polyedge with three components. In this case, at n-th round, the structure is a polyedge with 3*a(n) components.

Crossrefs

Formula

[No formula or recurrence is known, - N. J. A. Sloane, Oct 13 2023]
For n >= 2, a(n) = 2 + Sum_{k=2..n} 6*A220498(k-1) - 6. - Christopher Hohl, Feb 24 2019. [This is a restatement of the definition. - N. J. A. Sloane, Oct 13 2023]

Extensions

a(9)-a(12) from N. J. A. Sloane, Dec 07 2012
Corrected and extended by David Applegate, Dec 12 2012

A161328 E-toothpick sequence (see Comments lines for definition).

Original entry on oeis.org

0, 1, 4, 9, 16, 29, 40, 57, 72, 93, 116, 141, 168, 201, 228, 253, 268, 293, 328, 369, 424, 477, 536, 597, 656, 721, 784, 841, 888, 925, 972, 1037, 1108, 1205, 1300, 1405, 1500, 1589, 1672, 1753, 1840, 1933, 2012, 2085, 2164, 2253, 2360, 2473, 2592, 2705, 2820
Offset: 0

Views

Author

Omar E. Pol, Jun 07 2009

Keywords

Comments

An E-toothpick is formed by three toothpicks, as an trident. The E-toothpick has a midpoint and three exposed endpoints such that the distance between the endpoint of the central toothpick and the endpoints of the other toothpicks is equal to 1.
On the infinite triangular grid, we start at round 0 with no E-toothpicks.
At round 1 we place an E-toothpick anywhere in the plane.
At round 2 we add three more E-toothpicks.
At round 3 we add five more E-toothpicks.
And so on... (see illustrations).
The rule for adding new E-toothpicks is as follows. Each E has three ends, which initially are free. If the ends of two E's meet, those ends are no longer free. To go from round n to round n+1, we add an E-toothpick at each free end (extending that end in the direction it is pointing), subject to the condition that no end of any new E can touch any end of an existing E from round n or earlier. (Two new E's are allowed to touch.)
The sequence gives the number of E-toothpicks in the structure after n rounds. A161329 (the first differences) gives the number added at the n-th round.
Note that, on the infinite triangular grid, a E-toothpick can be represented as a polyedge with three components. In this case, at n-th round, the structure is a polyedge with 3*a(n) components. See the entry A139250 for more information about the growth of the toothpicks.
See also the snowflake sequence A161330.

Crossrefs

Formula

For n >= 3, a(n) = 4 + Sum_{k=3..n} 2*Sum_{x=1..3} A220498(k-x) + 2^((k mod 2) + 1) - 7. - Christopher Hohl, Feb 24 2019

Extensions

a(8) corrected, more terms appended by R. J. Mathar, Jan 21 2010
Extensive edits by Omar E. Pol, May 14 2012
I have copied the rule for adding new E-toothpicks (described by N. J. A. Sloane) from A161330. - Omar E. Pol, Dec 07 2012

A220478 Equilateral triangle from the snowflake (or E-toothpick) structure of A161330 (see Comments lines for definition).

Original entry on oeis.org

0, 2, 4, 6, 10, 12, 16, 20, 24, 30, 34, 40, 48, 50, 54, 58, 64, 74, 80, 94, 102, 112, 126, 134, 146, 160, 164, 172, 180, 190, 206, 218, 240, 256, 272, 290, 302, 316, 332, 348, 364, 374, 386, 406, 420, 442, 464, 482, 500, 524, 542, 570, 588, 608, 636, 658, 686, 706, 724, 742
Offset: 0

Views

Author

Omar E. Pol, Dec 22 2012

Keywords

Comments

It appears that if n >> 1 the structure looks like an equilateral triangle, which is essentially one of the six wedges of the E-toothpick (or snowflake) structure of A161330. The sequence gives the number of E-toothpicks in the structure after n stages. A220498 (the first differences) gives the number added at the n-th round. For more information and some illustrations see A161330. For the E-toothpick right triangle see A211964.

Crossrefs

Formula

a(n) = n + (A161330(n) - 2)/6, n >= 1.
a(n) = n + A161336(n) = 2*A211964(n).
Showing 1-3 of 3 results.