A182632 -id:A182632 - cp's OEIS frontend

A182633 Number of toothpicks added at n-th stage in the toothpick structure of A182632.

0, 3, 6, 12, 12, 12, 24, 36, 24, 12, 24, 48, 60, 48, 60, 84, 48, 12, 24, 48, 60, 60, 84, 132, 132, 72, 60, 120, 168, 144, 156, 192, 96, 12, 24, 48, 60, 60, 84, 132, 132, 84, 84, 156, 228, 228, 228

Offset: 0

Omar E. Pol, Dec 07 2010

First differences of A182632.

a(n) is also the number of components added at n-th stage in the toothpick structure formed by V-toothpicks with an initial Y-toothpick, since a V-toothpick has two components and a Y-toothpick has three components (For more information see A161206, A160120, A161644).

			From _Omar E. Pol_, Feb 08 2013 (Start):
When written as a triangle:
0;
3;
6;
12,12;
12,24,36,24;
12,24,48,60,48,60, 84, 48;
12,24,48,60,60,84,132,132,72,60,120,168,144,156,192,96;
12,24,48,60,60,84,132,132,84,84,156,228,228,228,...
...
It appears that positive terms of the right border are A007283.
(End)

David Applegate, The movie version
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to toothpick sequences
Index entries for sequences related to cellular automata

A139250, A139251, A160120, A160121, A161206, A161207, A161644, A161645, A182632.

It appears that a(n) = 2*A161645(n) but with a(1)=3.

a(n) = 3*A182635(n). - Omar E. Pol, Feb 09 2013

A151723 Total number of ON states after n generations of cellular automaton based on hexagons.

Original entry on oeis.org

0, 1, 7, 13, 31, 37, 55, 85, 127, 133, 151, 181, 235, 289, 331, 409, 499, 505, 523, 553, 607, 661, 715, 817, 967, 1069, 1111, 1189, 1327, 1489, 1603, 1789, 1975, 1981, 1999, 2029, 2083, 2137, 2191, 2293, 2443, 2545, 2599, 2701, 2875, 3097, 3295

Offset: 0

David Applegate and N. J. A. Sloane, Jun 13 2009

nonn

Analog of A151725, but here we are working on the triangular lattice (or the A_2 lattice) where each hexagonal cell has six neighbors.
A cell is turned ON if exactly one of its six neighbors is ON. An ON cell remains ON forever.
We start with a single ON cell.
It would be nice to find a recurrence for this sequence!
Has a behavior similar to A182840 and possibly to A182632. - Omar E. Pol, Jan 15 2016

S. M. Ulam, On some mathematical problems connected with patterns of growth of figures, pp. 215-224 of R. E. Bellman, ed., Mathematical Problems in the Biological Sciences, Proc. Sympos. Applied Math., Vol. 14, Amer. Math. Soc., 1962 (see Example 6, page 224).

N. J. A. Sloane, Table of n, a(n) for n = 0..4095 [First 1026 terms from David Applegate and N. J. A. Sloane]
David Applegate, The movie version
David Applegate and N. J. A. Sloane, Table of n, A151724(n), A151723(n) for n = 0..1025
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
Bradley Klee, Log-periodic coloring, over the half-hexagon tiling.
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
N. J. A. Sloane, Exciting Number Sequences (video of talk), Mar 05 2021

Cf. A147562, A151724, A151725, A161206, A161644, A169779, A169780, A170898, A170905, A182632, A182840, A256536, A256537.

A151723[0] = 0; A151723[n_] := Total[CellularAutomaton[{10926, {2, {{2, 2, 0}, {2, 1, 2}, {0, 2, 2}}}, {1, 1}}, {{{1}}, 0}, {{{n - 1}}}], 2]; Array[A151723, 47, 0](* JungHwan Min, Sep 01 2016 *)
A151723L[n_] := Prepend[Total[#, 2] & /@ CellularAutomaton[{10926, {2, {{2, 2, 0}, {2, 1, 2}, {0, 2, 2}}}, {1, 1}}, {{{1}}, 0}, n - 1], 0]; A151723L[46] (* JungHwan Min, Sep 01 2016 *)

a(n) = 6*A169780(n) - 6*n + 1 (this is simply the definition of A169780).
a(n) = 1 + 6*A169779(n-2), n >= 2. - Omar E. Pol, Mar 19 2015
It appears that a(n) = a(n-2) + 3*(A256537(n) - 1), n >= 3. - Omar E. Pol, Apr 04 2015

Edited by N. J. A. Sloane, Jan 10 2010

A182840 Toothpick sequence on hexagonal net.

Original entry on oeis.org

0, 1, 5, 13, 27, 43, 57, 81, 119, 151, 165, 189, 235, 299, 353, 409, 495, 559, 573, 597, 643, 707, 769, 849, 975, 1119, 1205, 1261, 1371, 1539, 1697, 1841, 2039, 2167, 2181, 2205, 2251, 2315, 2377, 2457, 2583, 2727, 2821, 2901, 3043, 3267, 3505, 3729, 4015

Offset: 0

Omar E. Pol, Dec 09 2010

nonn

Rules:
- Each new toothpick must lie on the hexagonal net such that the toothpick endpoints coincide with two consecutive nodes.
- Each exposed endpoint of the toothpicks of the old generation must be touched by the endpoints of two toothpicks of new generation.
The sequence gives the number of toothpicks after n stages. A182841 (the first differences) gives the number added at the n-th stage.
The toothpick structure has polygons in which there are uncovered grid points, the same as A160120 and A161206. For more information see A139250.
Has a behavior similar to A151723, A182632. - Omar E. Pol, Feb 28 2013
From Omar E. Pol, Feb 17 2023: (Start)
Assume that every triangular cell has area 1.
It appears that the structure contains only three types of polygons:
- Regular hexagons of area 6.
- Concave decagons (or concave 10-gons) of area 12.
- Concave dodecagons (or concave 12-gons) of area 18.
There are infinitely many of these polygons.
The structure contains concentric hexagonal rings formed by hexagons and also contains concentric hexagonal rings formed by alternating decagons and dodecagons.
For an animation see the movie version in the Links section.
The animation shows the fractal-like behavior the same as in other members of the family of toothpick cellular automata.
The structure has internal growth.
For another version starting from a node see A182632.
For a version of the structure in the first quadrant but on the square grid see A182838. (End)

			We start at stage 0 with no toothpicks.
At stage 1 we place a toothpick anywhere in the plane (For example, in vertical position). There are two exposed endpoints, so a(1)=1.
At stage 2 we place 4 toothpicks. Two new toothpicks touching each exposed endpoint. So a(2)=1+4=5. There are 4 exposed endpoints.
At stage 3 we place 8 toothpicks. a(3)=5+8=13. The structure has 8 exposed endpoints.
At stage 4 we place 14 toothpicks (Not 16) because there are 4 endpoints that are touched by new 8 toothpicks but there are 4 endpoints that are touched by only 6 new toothpicks (not 8), so a(4)=13+14=27.
After 4 stages the toothpick structure has 4 hexagons and 8 exposed endpoints.

Olaf Voß, Table of n, a(n) for n = 0..1000
David Applegate, The movie version
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Olaf Voß, Illustration of initial terms
Index entries for sequences related to toothpick sequences
Index entries for sequences related to cellular automata

Cf. A139250, A160120, A161206, A182632, A182634, A182838.

More terms from Olaf Voß, Dec 24 2010

Wiki link added by Olaf Voß, Jan 14 2011

A161644 Number of ON states after n generations of cellular automaton based on triangles.

Original entry on oeis.org

0, 1, 4, 10, 16, 22, 34, 52, 64, 70, 82, 106, 136, 160, 190, 232, 256, 262, 274, 298, 328, 358, 400, 466, 532, 568, 598, 658, 742, 814, 892, 988, 1036, 1042, 1054, 1078, 1108, 1138, 1180, 1246, 1312, 1354, 1396, 1474, 1588, 1702, 1816, 1966, 2104, 2164, 2194

Offset: 0

David Applegate and N. J. A. Sloane, Jun 15 2009

nonn

Analog of A151723 and A151725, but here we are working on the hexagonal net where each triangular cell has three neighbors (meeting along its edges). A cell is turned ON if exactly one of its three neighbors is ON. An ON cell remains ON forever.
We start with a single ON cell.
There is a dual version where the triangular cells meet vertex-to-vertex. The counts are the same: the two versions are isomorphic. Reed (1974) uses the vertex-to-vertex version. See the two Sloane "Illustration" links below to compare the two versions.
It appears that a(n) is also the number of polytoothpicks added in a toothpick structure formed by V-toothpicks but starting with a Y-toothpick: a(n) = a(n-1)+(A182632(n)-A182632(n-1))/2. (Checked up to n=39.) - Omar E. Pol, Dec 07 2010 and R. J. Mathar, Dec 17 2010
It appears that the behavior is similar to A161206. - Omar E. Pol, Jan 15 2016
It would be nice to have a formula or recurrence.
If new triangles are required to always move outwards we get A295559 and A295560.
From Paul Cousin, May 23 2025: (Start)
This is ETA rule 242 (11110010 in binary):
  -----------------------------------------------
  |state of the cell            |1|1|1|1|0|0|0|0|
  |sum of the neighbors' states |3|2|1|0|3|2|1|0|
  |cell's next state            |1|1|1|1|0|0|1|0|
  ----------------------------------------------- (End)

R. Reed, The Lemming Simulation Problem, Mathematics in School, 3 (#6, Nov. 1974), front cover and pp. 5-6. [Describes the dual structure where new triangles are joined at vertices rather than edges.]
S. Ulam, On some mathematical problems connected with patterns of growth of figures, pp. 215-224 of R. E. Bellman, ed., Mathematical Problems in the Biological Sciences, Proc. Sympos. Applied Math., Vol. 14, Amer. Math. Soc., 1962. See Example 3.

Paul Cousin, Table of n, a(n) for n = 0..16385 (first 10001 terms from Rémy Sigrist)
David Applegate, The movie version
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
Paul Cousin, ETA rule 242
Paul Cousin, Triangular Automata Integer Sequences
Lucas Garron, first 64 steps
Lucas Garron, after 128 steps
R. Reed, The Lemming Simulation Problem, Mathematics in School, 3 (#6, Nov. 1974), front cover and pp. 5-6. [Scanned photocopy of pages 5, 6 only, with annotations by R. K. Guy and N. J. A. Sloane]
Rémy Sigrist, PARI program for A161644
N. J. A. Sloane, Illustration of first 7 generations of A161644 and A295560 (edge-to-edge version)
N. J. A. Sloane, Illustration of first 11 generations of A161644 and A295560 (vertex-to-vertex version) [Include the 6 cells marked x to get A161644(11), exclude them to get A295560(11).]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A151723, A151725, A147562, A161206, A161645, A139250, A160120, A161206, A182632, A182840, A250300, A295559, A295560.

PARI
```
\\ See Links section.
```

a(n) = (A182632(n) - 1)/2, n >= 1. - Omar E. Pol, Mar 07 2013

Edited by N. J. A. Sloane, Jan 10 2010 and Nov 27 2017

A182838 H-toothpick sequence in the first quadrant starting with a D-toothpick placed on the diagonal [(0,1), (1,2)] (see Comments for precise definition).

Original entry on oeis.org

0, 1, 3, 7, 11, 15, 21, 31, 39, 43, 49, 61, 77, 91, 105, 127, 143, 147, 153, 165, 181, 197, 217, 249, 285, 307, 321, 349, 391, 431, 467, 517, 549, 553, 559, 571, 587, 603, 623, 655, 691, 715

Offset: 0

Omar E. Pol, Dec 12 2010

An H-toothpick sequence is a toothpick sequence on a square grid that resembles a partial honeycomb of hexagons.
The structure has two types of elements: the classic toothpicks with length 1 and the "D-toothpicks"  with length sqrt(2).
Classic toothpicks are placed in the vertical direction and D-toothpicks are placed in a diagonal direction.
Each hexagon has area = 4.
The network looks like an elongated hexagonal lattice placed on the square grid so that all nodes of the hexagonal net coincide with some of the grid points of the square grid. Each node in the hexagonal network is represented with coordinates x,y.
The sequence gives the number of toothpicks and D-toothpicks after n steps. A182839 (first differences) gives the number added at the n-th stage.
[It appears that for this sequence a classic toothpick is a line segment of length 1 that is parallel to the y-axis. A D-toothpick is a line segment of length sqrt(2) with slope +-1. D stands for diagonal. It also appears that classic toothpicks are not placed on the y-axis. - N. J. A. Sloane, Feb 06 2023]
From Omar E. Pol, Feb 17 2023: (Start)
This cellular automaton appears to be a version on the square grid of the first quadrant of the structure of A182840.
The rules are as follows:
- The elements (toothpicks and D-toothpicks) are connected at their ends.
- At each free end of the elements of the old generation two elements of the new generation must be connected.
- The toothpicks of length 1 must always be placed vertically, i.e. parallel to the Y-axis.
- The angle between a toothpick of length 1 and a D-toothpick of length sqrt(2) that share the same node must be 135 degrees, therefore the angle between two D-toothpicks that share the same node is 90 degrees.
As a result of these rules we can see that in the odd-indexed rows of the structure are placed only the toothpicks of length 1 and in the even-indexed rows of the structure are placed the D-toothpicks of length sqrt(2).
Apart from the trapezoids, pentagons and heptagons that are adjacent to the axes of the first quadrant it appears that there are only three types of polygons:
- Regular hexagons of area 4.
- Concave decagons (or concave 10-gons) of area 8.
- Concave dodecagons (or concave 12-gons) of area 12.
There are infinitely many of these polygons.
The structure shows a fractal-like behavior as we can see in other members of the family of toothpick cellular automata.
The structure has internal growth as some members of the mentioned family. (End)

			We start at stage 0 with no toothpicks.
At stage 1 we place a D-toothpick [(0,1),(1,2)], so a(1)=1.
At stage 2 we place a toothpick [(1,2),(1,3)] and a D-toothpick [(1,2),(2,1)], so a(2)=1+2=3.
At stage 3 we place 4 elements: a D-toothpick [(1,3),(0,4)], a D-toothpick [(1,3),(2,4)], a D-toothpick [(2,1),(3,2)] and a toothpick [(2,1),(2,0)], so a(3)=3+4=7. Etc.
The first hexagon appears in the structure after 4 stages.

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
Omar E. Pol, Illustration of initial terms
Omar E. Pol, Illustration of a(32) = 549
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to toothpick sequences

Cf. A139250, A153000, A161206, A170888, A172308, A182632, A182634, A182839, A182840, A187212, A194444, A220524, A233970, A267458, A267694, A267698.

See A360501 and A360512 for another hexagonal net built on the square grid. - N. J. A. Sloane, Feb 09 2023

Conjecture: a(n) = (A182840(n+1) + A267458(n+1) - 2)/4. - Omar E. Pol, Feb 10 2023

Partially edited by N. J. A. Sloane, Feb 06 2023

a(19)-a(41) from Omar E. Pol, Feb 06 2023

A182634 Toothpick sequence on hexagonal net starting at the vertex of an infinite 120-degree wedge.

Original entry on oeis.org

0, 1, 3, 7, 11, 15, 23, 35, 43, 47, 55, 71, 91, 107, 127, 155, 171, 175, 183, 199, 219, 239, 267, 311, 355, 379, 399, 439, 495, 543, 595, 659, 691, 695, 703, 719, 739, 759, 787, 831, 875, 903, 931, 983, 1059, 1135, 1211

Offset: 0

Omar E. Pol, Dec 08 2010

The sequence gives the number of toothpicks after n stages. A182635 (the first differences) gives the number added at the n-th stage.
The 120-degree wedge defines a conic region which toothpicks (except one end point of the initial toothpick) are not allowed to cross or touch. The wings of the wedge point +-60 degrees away from the pointing direction of the initial toothpick.
Toothpicks are connected by their endpoints, the same as the toothpicks of A182632.
First differs from A139250 at a(11).

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to toothpick sequences [From _Omar E. Pol_, Dec 06 2009]
Index entries for sequences related to cellular automata

Cf. A139250, A160406, A160120, A161206, A161644, A182632, A182633, A182635.

a(n) = A182632(n)/3.

A182622 a(n) is the number whose binary representation is the concatenation of the divisors of n written in base 2.

Original entry on oeis.org

1, 6, 7, 52, 13, 222, 15, 840, 121, 858, 27, 28268, 29, 894, 991, 26896, 49, 113970, 51, 215892, 2037, 3446, 55, 14471576, 441, 3514, 3899, 217052, 61, 14538238, 63, 1721376, 7905, 13410, 7139, 926213284, 101, 13542, 8039, 221009192

Offset: 1

Omar E. Pol, Nov 22 2010

a(n) is A182621(n), interpreted as a binary number, written in base 10. The first repeated element is 991, from 15 and 479.

Except for 1, no power of 2 can occur in this sequence, an obvious consequence of the fact that a(n) has to be the sum of at least two distinct powers of 2 for all n > 1. - Alonso del Arte, Nov 13 2013

			The divisors of 10 are 1, 2, 5, 10. Then 1, 2, 5, 10 written in base 2 are 1, 10, 101, 1010. The concatenation of 1, 10, 101, 1010 is 1101011010. Then a(10) = 858 because the binary number 1101011010 written in base 10 is 858.

Indranil Ghosh, Table of n, a(n) for n = 1..50000

Cf. A027750, A007088, A182620, A182621, A182623, A182624, A182627, A182632.

concatBits[n_] := FromDigits[Join @@ (IntegerDigits[#, 2]& /@ Divisors[n]), 2]; concatBits /@ Range[40](* Giovanni Resta, Nov 23 2010 *)

a(n) = {my(cbd = []); fordiv(n, d, cbd = concat(cbd, binary(d));); fromdigits(cbd, 2);} \\ Michel Marcus, Jan 28 2017

def A182622(n):
    s=""
    for i in range(1,n+1):
        if n%i==0:
            s+=bin(i)[2:]
    return int(s,2) # Indranil Ghosh, Jan 28 2017

a(p) = 2^(floor(log_2(p)) + 1) + p for p prime. Also, a(p + k) > a(p) for all k > 0. Furthermore, for all primes p > 3, a(p) < a(p - 1).

a(2^(m - 1)) = sum(k = 0 .. m - 1, 2^((m^2 + m)/2 - (k^2 + k)/2 - 1)) = A164894(m). - Alonso del Arte, Nov 13 2013

More terms from Giovanni Resta, Nov 23 2010

A233970 Toothpick sequence on hexagonal net starting from the vertex of a 60-degree wedge (see Comments lines for precise definition).

Original entry on oeis.org

0, 1, 3, 5, 9, 11, 15, 21, 29, 31, 35, 41, 51, 61, 69, 83, 99, 101, 105, 111, 121, 131, 141, 159, 183, 205, 213, 227, 249, 275, 291, 321, 353, 355, 359, 365, 375, 385, 395, 413, 437, 459, 469, 487, 515, 553, 581, 627, 683, 737, 745, 759, 781, 807

Offset: 0

Omar E. Pol, Dec 18 2013

nonn

Toothpicks are connected by their endpoints. The toothpicks placed in north direction are prohibited. The sequence gives the number of toothpicks after n-th stage in the structure. A233971 (the first differences) give the number of toothpicks added at n-th stage.
First differs from A169780 at a(24).
First differs from both A233764 and A233780 at a(25).

Cf. A139250, A161206, A161830, A169780, A182632, A182634, A182634, A182840, A233760, A233764, A233780, A233971, A233972.

A222180 Total number of ON states after n generations of cellular automaton based on pentagons. Also P-toothpick sequence (see Comments lines for definition).

Original entry on oeis.org

0, 1, 6, 16, 26, 36, 56, 86, 106, 116, 136, 176, 216, 246, 296, 366, 406, 416, 436, 476, 536, 616

Offset: 0

Omar E. Pol, Mar 15 2013

Analog of A161644, A147562 and A151723, but here we are working without a lattice. Each regular pentagon has five virtual neighbors. Overlapping are prohibited. The sequence gives the number of pentagons in the structure after n-th stage. A222181 (the first differences) gives the number of pentagons added at n-th stage.

Also this is a P-toothpick sequence since every pentagon can be replaced by a P-toothpick which is formed by five toothpicks as a five-pointed star. Note that each toothpick can be represented as an apothem or as a radius of a pentagon. In both types of structures the number of toothpicks after n-th stage is equal to 5*a(n).

Omar E. Pol, Illustration of structure after 5 stages, (Contains 36 pentagons).
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to toothpick sequences

Cf. A139250, A147562, A151723, A152968, A161330, A161644, A182632, A182840, A222172, A222176, A222181.

a(n) = 6 + 10*A222172(n-2), n >= 2. - Omar E. Pol, Nov 24 2013

Name improved by Omar E. Pol, Nov 24 2013

A253770 Number of ON states after n generations of cellular automaton based on triangles, with diamonds.

Original entry on oeis.org

0, 6, 24, 42, 96, 114, 168, 222, 348, 402, 456, 510, 636, 726, 852, 1014, 1320, 1482, 1536, 1590, 1716, 1806, 1932, 2094, 2400, 2598, 2724, 2886, 3192, 3498, 3840, 4254, 4956, 5442, 5568, 5622, 5748, 5838, 5964, 6126, 6432, 6630, 6756, 6918, 7224, 7530, 7872, 8286

Offset: 0

Omar E. Pol, Jan 11 2015

nonn

Also 6 times the Y-toothpicks sequence A160120.
Explanation: consider the Y-toothpick structure of A160120, then replace every Y-toothpick with six ON cells forming a star with three rhombuses (or diamonds) that share only one vertex. Every diamond contains two triangular cells that share one edge.
The rules are the essentially the same as A160120.
An ON cell remains ON forever.
The sequence gives the number of triangular ON cells after the n-th stage.
A253771 (the first differences) give the number of triangular cells turned "ON" at the n-th stage.
A160120 (the Y-toothpick sequence) gives the number of stars in the structure after the n-th stage.
A160121 gives the number of stars added at the n-th stage.
A160167 gives the number of diamonds in the structure after the n-th stage.

			After one generation, the cellular automaton looks like a star or a flower with three petals as shown below:
.
.        /\
.       _\/_
.      /_/\_\
.
There are one star, three diamonds and six ON cells, so a(1) = 6.

Cf. A139250, A147562, A151723, A160120, A160157, A160167, A161644, A182632, A250300, A253771.

a(n) = 6*A160120(n) = 3*A160157(n) = 2*A160167(n).

cp's OEIS Frontend

A182633 Number of toothpicks added at n-th stage in the toothpick structure of A182632.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A151723 Total number of ON states after n generations of cellular automaton based on hexagons.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A182840 Toothpick sequence on hexagonal net.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A161644 Number of ON states after n generations of cellular automaton based on triangles.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

PARI

Formula

Extensions

A182838 H-toothpick sequence in the first quadrant starting with a D-toothpick placed on the diagonal [(0,1), (1,2)] (see Comments for precise definition).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A182634 Toothpick sequence on hexagonal net starting at the vertex of an infinite 120-degree wedge.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A182622 a(n) is the number whose binary representation is the concatenation of the divisors of n written in base 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A233970 Toothpick sequence on hexagonal net starting from the vertex of a 60-degree wedge (see Comments lines for precise definition).

Views

Author

Keywords

Comments