A139251 -id:A139251 - cp's OEIS frontend

A153006 Toothpick sequence starting at the outside corner of an infinite square from which protrudes a half toothpick.

0, 1, 3, 6, 9, 13, 20, 28, 33, 37, 44, 53, 63, 78, 100, 120, 129, 133, 140, 149, 159, 174, 196, 217, 231, 246, 269, 297, 332, 384, 448, 496, 513, 517, 524, 533, 543, 558, 580, 601, 615, 630, 653, 681, 716, 768, 832, 881, 903, 918, 941

Offset: 0

Omar E. Pol, Dec 17 2008, Dec 19 2008, Apr 28 2009

nonn

a(n) is the total number of integer toothpicks after n steps.
It appears that this sequence is related to triangular numbers, Mersenne primes and even perfect numbers. Conjecture: a(A000668(n))=A000217(A000668(n)). Conjecture: a(A000668(n))=A000396(n), assuming there are no odd perfect numbers.
The main entry for this sequence is A139250. See also A152980 (the first differences) and A147646.
The Mersenne prime conjectures are true, but aren't really about Mersenne primes. a(2^i-1) = 2^i (2^i-1)/2 for all i (whether or not i or 2^i-1 is prime). This follows from the formulas for A139250(2^i-1) and A139250(2^i). - David Applegate, May 11 2009
Then we can write a(A000225(k)) = A006516(k), for k > 0. - Omar E. Pol, May 23 2009
Equals A151550 convolved with [1, 2, 2, 2, ...]. (This is equivalent to the observation that the g.f. is x((1+x)/(1-x)) * Product_{n >= 1} (1 + x^(2^n-1) + 2*x^(2^n)).) Equivalently, equals A151555 convolved with A151575. - Gary W. Adamson, May 25 2009
It appears that a(n) is also 1/4 of the total path length of a toothpick structure as A139250 after n-th stage which is constructed following a special rule: toothpicks of the new generation have length 4 when are placed on the square grid (every toothpick has four components of length 1), but after every stage, one (or two) of the four components of every toothpick of the new generation is removed, if such component contains a endpoint of the toothpick and if such endpoint is touching the midpoint or the endpoint of another toothpick. The truncated endpoints of the toothpicks remain exposed forever. Note that there are three sizes of toothpicks in the structure: toothpicks of length 4, 3 and 2. a(n) is also 1/4 of the number of grid points that are covered after n-th stage, except the central point of the structure. A159795 gives the total path length and also the total number of components in the structure after n-th stage. - Omar E. Pol, Oct 24 2011

N. J. A. Sloane, Table of n, a(n) for n = 0..16387
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.]
Omar E. Pol, Illustration of initial terms
Omar E. Pol, Illustration of A153006(31) = 496
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

Cf. A000079, A000217, A000396, A000668, A139250, A139251, A139560, A152978, A152979, A152980, A153000, A153001, A153002.
Cf. A000225, A006516.
Cf. A153007, A078008, A151555.

G:=x*((1 + x)/(1 - x)) * mul( (1 + x^(2^n-1) + 2*x^(2^n)), n=1..20); # N. J. A. Sloane, May 20 2009

G.f.: x*((1 + x)/(1 - x)) * Product_{n >= 1} (1 + x^(2^n-1) + 2*x^(2^n)). - N. J. A. Sloane, May 20 2009

Edited by N. J. A. Sloane, Dec 19 2008

A152980 First differences of toothpick corner sequence A153006.

Original entry on oeis.org

1, 2, 3, 3, 4, 7, 8, 5, 4, 7, 9, 10, 15, 22, 20, 9, 4, 7, 9, 10, 15, 22, 21, 14, 15, 23, 28, 35, 52, 64, 48, 17, 4, 7, 9, 10, 15, 22, 21, 14, 15, 23, 28, 35, 52, 64, 49, 22, 15, 23, 28, 35, 52, 65, 56, 43, 53, 74, 91, 122, 168, 176, 112, 33, 4, 7, 9, 10, 15, 22, 21, 14, 15, 23, 28, 35, 52

Offset: 0

Omar E. Pol, Dec 16 2008, Dec 19 2008, Jan 02 2009

Rows of A152978 when written as a triangle converge to this sequence. - Omar E. Pol, Jul 19 2009

			Triangle begins:
.1;
.2;
.3,3;
.4,7,8,5;
.4,7,9,10,15,22,20,9;
.4,7,9,10,15,22,21,14,15,23,28,35,52,64,48,17;
....
Rows converge to A153001. - _N. J. A. Sloane_, Jun 07 2009

N. J. A. Sloane, Table of n, a(n) for n = 0..16384
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

Equals A151688 divided by 2. - N. J. A. Sloane, Jun 03 2009
For generating functions of the form Product_{k>=c} (1+a*x^(2^k-1)+b*x^2^k) for the following values of (a,b,c) see: (1,1,0) A160573, (1,1,1) A151552, (1,1,2) A151692, (2,1,0) A151685, (2,1,1) A151691, (1,2,0) A151688 and A152980, (1,2,1) A151550, (2,2,0) A151693, (2,2,1) A151694.
Equals A147646/4. - N. J. A. Sloane, May 01 2009
Cf. A139250, A139251, A152968, A152978, A153006, A153001, A159785, A153004.

Maple code from N. J. A. Sloane, May 18 2009. First define old version with offset 1:
S:=proc(n) option remember; local i,j;
if n <= 0 then RETURN(0); fi;
if n <= 2 then RETURN(2^(n-1)); fi;
i:=floor(log(n)/log(2));
j:=n-2^i;
if j=0 then RETURN(n/2+1); fi;
if j<2^i-1 then RETURN(2*S(j)+S(j+1)); fi;
if j=2^i-1 then RETURN(2*S(j)+S(j+1)-1); fi;
-1;
end;
# Now change the offset:
T:=n->S(n+1);
G := (1 + x) * mul(1 + x^(2^k-1) + 2*x^(2^k),k=1..20);

nmax = 78;
G = x*((1 + x)/(1 - x)) * Product[ (1 + x^(2^n - 1) + 2*x^(2^n)), {n, 1, Log2[nmax] // Ceiling}];
CoefficientList[G + O[x]^nmax, x] // Differences (* Jean-François Alcover, Jul 21 2022 *)

G.f.: (1 + x) * Prod_{ n >= 1} (1 + x^(2^n-1) + 2*x^(2^n)). - N. J. A. Sloane, May 20 2009, corrected May 21 2009

For formula see A147646 (or, better, see the Maple code below).

More terms (based on A147646) from N. J. A. Sloane, May 01 2009

Offset changed by N. J. A. Sloane, May 18 2009

A160121 First differences of A160120.

Original entry on oeis.org

1, 3, 3, 9, 3, 9, 9, 21, 9, 9, 9, 21, 15, 21, 27, 51, 27, 9, 9, 21, 15, 21, 27, 51, 33, 21, 27, 51, 51, 57, 69, 117, 81, 21, 9, 21, 15, 21, 27, 51, 33, 21, 27, 51, 51, 57, 69, 117, 87, 33, 27, 51, 51, 57, 75, 129, 117, 75, 69, 117, 135, 141, 171, 279, 231, 69, 9, 21, 15, 21, 27

Offset: 1

Omar E. Pol, May 02 2009

nonn

Number of Y-toothpicks added at n-th stage to the Y-toothpick structure of A160120.

For a simpler version, see A151710. - Omar E. Pol, Dec 18 2012

			Contribution from _Omar E. Pol_, Jun 18 2009: (Start)
May be written as a triangle:
1,
3,
3,
9,
3,9,
9,21,9,9,
9,21,15,21,27,51,27,9,
9,21,15,21,27,51,33,21,27,51,51,57,69,117,81,21,
9,21,15,21,27,51,33,21,27,51,51,57,69,117,87,33,27,51,51,57,75,129,117,75,69,117,135,141,171,279,231,69;
Rows converge to A161326.
(End)
Contribution from _Omar E. Pol_, Dec 18 2012: (Start):
Also this sequence may be written as another triangle (according to the structure of triangle A151710):
1;
3;
3,  9;
3,  9,9,21;
9,  9,9,21,15,21,27,51;
27, 9,9,21,15,21,27,51,33,21,27,51,51,57,69,117;
81,21,9,21,15,21,27,51,33,21,27,51,51,57,69,117,87,33,27,51,51,57,75,129,117,75,69,117,135,141,171,279;
(End)

JungHwan Min, Table of n, a(n) for n = 1..5000
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.]
David Applegate, The movie version
Omar E. Pol, Illustration of initial terms of A139251, A160121, A147582 (Overlapping figures) [_Omar E. Pol_, Nov 02 2009]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A139250, A139251, A151710, A160171, A160173, A160120, A160715, A161207, A161329, A161331, A161326, A161431, A147582.

YTPFunc[lis_, step_] := With[{out = Extract[lis, {{1, 2}, {2, 1}, {-1, -1}}], in = lis[[2, 2]]}, Which[in == 1, 3, in == 0 && Count[out, 1] >= 2, 2, in == 0 && Count[out, 1] == 1, 1, True, in]]; A160121[n_] := Count[CellularAutomaton[{YTPFunc, {}, {1, 1}}, {{{1}}, 0}, {{{n}}}], 1, 2] (* JungHwan Min, Jan 28 2016 *)
A160121[n_] := Count[CellularAutomaton[{13390417258775213635414055181254541831894674613399006361662885886563211940509571858857491972104491013971547937418035084866785430974106432144737472376143620, 4, {{-1, 0}, {0, -1}, {0, 0}, {1, 1}}}, {{{1}}, 0}, {{{n}}}], 1, 2] (* JungHwan Min, Jan 28 2016 *)

More terms from David Applegate, Jun 14 2009

A160552 a(0)=0, a(1)=1; a(2^i+j) = 2*a(j) + a(j+1) for 0 <= j < 2^i.

Original entry on oeis.org

0, 1, 1, 3, 1, 3, 5, 7, 1, 3, 5, 7, 5, 11, 17, 15, 1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 19, 21, 39, 49, 31, 1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 19, 21, 39, 49, 31, 5, 11, 17, 19, 21, 39, 49, 35, 21, 39, 53, 59, 81, 127, 129, 63, 1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 19, 21, 39, 49, 31

Offset: 0

David Applegate, May 18 2009

nonn

This recurrence is patterned after the one for A152980, but without the special cases.
Sequence viewed as triangle:
  0,
  1,
  1, 3,
  1, 3, 5, 7,
  1, 3, 5, 7, 5, 11, 17, 15,
  1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 19, 21, 39, 49, 31.
The rows converge to A151548.
Also the sum of the terms in the k-th row (k >= 1) is 4^(k-1). Proof by induction. - N. J. A. Sloane, Jan 21 2010
If this sequence [1, 1, 3, 1, 3, 5, 7, 1, 3, 5, 7, 5, 11, 17, 15, ...] is convolved with [1, 2, 2, 2, 2, 2, 2, ...] we obtain A139250, the toothpick sequence. Example: A139250(5) = 15 = (1, 2, 2, 2, 2) * (3, 1, 3, 1, 1). - Gary W. Adamson, May 19 2009
Starting with 1 and convolved with [1, 2, 0, 0, 0, ...] = A151548. - Gary W. Adamson, Jun 04 2009
Refer to A162956 for the analogous triangle using N=3. - Gary W. Adamson, Jul 20 2009
It appears that the sums of two successive terms give the positive terms of A139251. - Omar E. Pol, Feb 18 2015

			a(2) = a(2^1+0) = 2*a(0) + a(1) = 1, a(3) = a(2^1+1) = 2*a(1) + a(2) = 3*a(2^i) = 2*a(0) + a(1) = 1.

N. J. A. Sloane, Table of n, a(n) for n = 0..16384
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

For the recurrence a(2^i+j) = C*a(j) + D*a(j+1), a(0) = A, a(1) = B for following values of (A B C D) see: (0 1 1 1) A118977, (1 0 1 1) A151702, (1 1 1 1) A151570, (1 2 1 1) A151571, (0 1 1 2) A151572, (1 0 1 2) A151703, (1 1 1 2) A151573, (1 2 1 2) A151574, (0 1 2 1) A160552, (1 0 2 1) A151704, (1 1 2 1) A151568, (1 2 2 1) A151569, (0 1 2 2) A151705, (1 0 2 2) A151706, (1 1 2 2) A151707, (1 2 2 2) A151708.
Cf. A152980, A139250, A139251, A151548, A160570, A151568.
Cf. A162956, A170903.

S:=proc(n) option remember; local i,j; if n <= 1 then RETURN(n); fi; i:=floor(log(n)/log(2)); j:=n-2^i; 2*S(j)+S(j+1); end; # N. J. A. Sloane, May 18 2009
H := x*(1+2*x)/(1+x) + (4*x^2/(1+2*x))*(mul(1+x^(2^k-1)+2*x^(2^k),k=1..20)-1); series(H,x,120); # N. J. A. Sloane, May 23 2009

Nest[Join[#, 2 # + Append[Rest@#, 1]] &, {0}, 7] (* Ivan Neretin, Feb 09 2017 *)

G.f.: x*(1+2*x)/(1+x) + (4*x^2/(1+2*x))*(-1 + Product_{k>=1} (1 + x^(2^k-1) + 2*x^(2^k))). - N. J. A. Sloane, May 23 2009, based on Gary W. Adamson's comment above and the known g.f. for A139250.
It appears that a(n) = A169708(n)/4, n >= 1. - Omar E. Pol, Feb 15 2015
It appears that a(n) = A139251(n) - a(n-1), n >= 1. - Omar E. Pol, Feb 18 2015

A160406 Toothpick sequence starting at the vertex of an infinite 90-degree wedge.

Original entry on oeis.org

0, 1, 2, 4, 6, 8, 10, 14, 18, 20, 22, 26, 30, 34, 40, 50, 58, 60, 62, 66, 70, 74, 80, 90, 98, 102, 108, 118, 128, 140, 160, 186, 202, 204, 206, 210, 214, 218, 224, 234, 242, 246, 252, 262, 272, 284, 304, 330, 346, 350, 356, 366, 376, 388, 408, 434, 452, 464, 484, 512, 542, 584

Offset: 0

Omar E. Pol, May 23 2009

nonn

Consider the wedge of the plane defined by points (x,y) with y >= |x|, with the initial toothpick extending from (0,0) to (0,2); then extend by the same rule as for A139250, always staying inside the wedge.
Number of toothpick in the structure after n rounds.
The toothpick sequence A139250 is the main entry for this sequence. See also A153000. First differences: A160407.

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
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A139250, A139251, A153000, A153006, A152980, A160407, A160408, A160409.

Cf. A170886-A170895.

G := (x + 2*x^2 + 4*x^2*(1+x)*(mul(1+x^(2^k-1)+2*x^(2^k),k=1..20)-1)/(1+2*x))/(1-x); P:=(G + 2 + x*(5-x)/(1-x)^2)*x/(2*(1+x)); series(P,x,200); seriestolist(%); # N. J. A. Sloane, May 25 2009

terms = 62;
G = (x + 2x^2 + 4x^2 (1+x)(Product[1+x^(2^k-1) + 2x^(2^k), {k, 1, Ceiling[ Log[2, terms]]}]-1)/(1+2x))/(1-x);
P = (G + 2 + x(5-x)/(1-x)^2) x/(2(1+x));
CoefficientList[P + O[x]^terms, x] (* Jean-François Alcover, Nov 03 2018, from Maple *)

A139250(n) = 2a(n) + 2a(n+1) - 4n - 1 for n > 0. - N. J. A. Sloane, May 25 2009

Let G = (x + 2*x^2 + 4*x^2*(1+x)*((Product_{k>=1} (1 + x^(2^k-1) + 2*x^(2^k))) - 1)/(1+2*x))/(1-x) (= g.f. for A139250); then the g.f. for the present sequence is (G + 2 + x*(5-x)/(1-x)^2)*x/(2*(1+x)). - N. J. A. Sloane, May 25 2009

More terms from N. J. A. Sloane, May 25 2009

Definition revised by N. J. A. Sloane, Jan 02 2010

A153000 Toothpick sequence in the first quadrant.

Original entry on oeis.org

0, 1, 2, 3, 5, 8, 10, 11, 13, 16, 19, 23, 30, 38, 42, 43, 45, 48, 51, 55, 62, 70, 75, 79, 86, 95, 105, 120, 142, 162, 170, 171, 173, 176, 179, 183, 190, 198, 203, 207, 214, 223, 233, 248, 270, 290, 299, 303, 310, 319, 329, 344, 366, 387

Offset: 0

Omar E. Pol, Dec 16 2008, Dec 20 2008, Jan 02 2009

nonn

From Omar E. Pol, Nov 29 2009: (Start)
At stage 0, we start from a horizontal half toothpick at [(0,1),(1,1)]. This half toothpick represents one of the two components of the second toothpick placed in the toothpick structure of A139250. Consider only the toothpicks of length 2, so a(0) = 0.
At stage 1 we place an orthogonal toothpick of length 2 centered at the end, so a(1) = 1.
In each subsequent stage, for every exposed toothpick end, place an orthogonal toothpick centered at that end.
The sequence gives the number of toothpicks after n stages. Note that this sequence contains even numbers and odd numbers, the same as A152978 (the first differences) which gives the number of toothpicks added  at n-th stage. For more information see A139250. (End)
A079559 gives the parity of this sequence, if n >= 1. - Omar E. Pol, Aug 13 2013

D. 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

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.], which is also available at arXiv:1004.3036v2, [math.CO], 2010.
Omar E. Pol, Illustration of initial terms [From Omar E. Pol, Nov 29 2009]
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

Cf. A139250, A139251, A152978, A153006.

Cf. A152998, A160406. - Omar E. Pol, Nov 29 2009

G := (1+x)*(mul(1+x^(2^k-1)+2*x^(2^k),k=1..20)-1)/((1-x)*(1+2*x)); # N. J. A. Sloane, May 20 2009

def msb(n):
    t=0
    while n>>t>0: t+=1
    return 2**(t - 1)
def a139250(n):
    k=(2*msb(n)**2 + 1)//3
    return 0 if n==0 else k if n==msb(n) else k + 2*a139250(n - msb(n)) + a139250(n - msb(n) + 1) - 1
def a(n): return 0 if n==0 else (a139250(n + 2) - 3)//4
print([a(n) for n in range(101)]) # Indranil Ghosh, Jul 01 2017

a(n) = (A139250(n+2)-3)/4 = (A152998(n+1)-1)/2.
G.f.: (1+x)*(Product_{k>=1} (1+x^(2^k-1)+2*x^(2^k))-1)/((1-x)*(1+2*x)). - N. J. A. Sloane, May 20 2009
Contribution from Omar E. Pol, Oct 01 2011: (Start)
a(n) = A152998(n+1) + A153003(n+1) - A139250(n+2) + 1.
a(n) = A139250(n+2) - A153003(n+1) - 2.
a(n) = A153003(n+1) - A152998(n+1).
(End)
a(n) = (A187220(n+3) - 7)/8. - Omar E. Pol, Feb 16 2013

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

Omar E. Pol, Jun 07 2009

nonn

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.

David Applegate, Table of n, a(n) for n = 0..1000
David Applegate, The movie version
David Applegate, Illustration of structure after 32 stages. (Contains 1124 E-toothpicks.)
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.]
Ed Jeffery, Illustration of A161330 structure after 32 stages, with E-toothpicks replace by rhombi (the figure on the right is the complementary structure)
Omar E. Pol, Illustration of initial terms of A160120, A161206, A161328, A161330 (Triangular grid and toothpicks) [From _Omar E. Pol_, Dec 06 2009]
N. J. A. Sloane, A single E-toothpick
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to cellular automata
Index entries for sequences related to toothpick sequences

Cf. A139250, A139251, A160120, A160172, A161206, A161328, A161331, A161333.

[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]

a(9)-a(12) from N. J. A. Sloane, Dec 07 2012

Corrected and extended by David Applegate, Dec 12 2012

A296612 Square array read by antidiagonals upwards: T(n,k) equals k times the number of compositions (ordered partitions) of n, with n >= 0 and k >= 1.

Original entry on oeis.org

1, 1, 2, 2, 2, 3, 4, 4, 3, 4, 8, 8, 6, 4, 5, 16, 16, 12, 8, 5, 6, 32, 32, 24, 16, 10, 6, 7, 64, 64, 48, 32, 20, 12, 7, 8, 128, 128, 96, 64, 40, 24, 14, 8, 9, 256, 256, 192, 128, 80, 48, 28, 16, 9, 10, 512, 512, 384, 256, 160, 96, 56, 32, 18, 10, 11, 1024, 1024, 768, 512, 320, 192, 112, 64, 36, 20, 11, 12

Offset: 0

Omar E. Pol, Jan 04 2018

Also, at least for the first five columns, column k gives the row lengths of the irregular triangles of the first differences of the total number of elements in the structure of some cellular automata. Indeed, the study of the structure and the behavior of the toothpick cellular automaton on triangular grid (A296510), and other C.A. of the same family, reveals that some cellular automata that have recurrent periods can be represented by irregular triangles (of first differences) whose row lengths are the terms of A011782 multiplied by k (instead of powers of 2), where k is the length of an internal cycle. This internal cycle is called here "word" of a cellular automaton (see examples).

			The corner of the square array begins:
    1,   2,   3,    4,    5,    6,    7,    8,    9,   10, ...
    1,   2,   3,    4,    5,    6,    7,    8,    9,   10, ...
    2,   4,   6,    8,   10,   12,   14,   16,   18,   20, ...
    4,   8,  12,   16,   20,   24,   28,   32,   36,   40, ...
    8,  16,  24,   32,   40,   48,   56,   64,   72,   80, ...
   16,  32,  48,   64,   80,   96,  112,  128,  144,  160, ...
   32,  64,  96,  128,  160,  192,  224,  256,  288,  320, ...
   64, 128, 192,  256,  320,  384,  448,  512,  576,  640, ...
  128, 256, 384,  512,  640,  768,  896, 1024, 1152, 1280, ...
  256, 512, 768, 1024, 1280, 1536, 1792, 2048, 2304, 2560, ...
...
For k = 1 consider A160120, the Y-toothpick cellular automaton, which has word "a", so the structure of the irregular triangle of the first differences (A160161) is as follows:
a;
a;
a,a;
a,a,a,a;
a,a,a,a,a,a,a,a;
...
An associated sound to the animation of this cellular automaton could be (tick), (tick), (tick), ...
The row lengths of the above triangle are the terms of A011782, equaling the column 1 of the square array: 1, 1, 2, 4, 8, ...
.
For k = 2 consider A139250, the normal toothpick C.A. which has word "ab", so the structure of the irregular triangle of the first differences (A139251) is as follows:
a,b;
a,b;
a,b,a,b;
a,b,a,b,a,b,a,b;
a,b,a,b,a,b,a,b,a,b,a,b,a,b,a,b;
...
An associated sound to the animation could be (tick, tock), (tick, tock), ..., the same as the ticking clock sound.
The row lengths of the above triangle are the terms of A011782 multiplied by 2, equaling the column 2 of the square array: 2, 2, 4, 8, 16, ...
.
For k = 3 consider A296510, the toothpicks C.A. on triangular grid, which has word "abc", so the structure of the irregular triangle of the first differences (A296511) is as follows:
a,b,c;
a,b,c;
a,b,c,a,b,c;
a,b,c,a,b,c,a,b,c,a,b,c;
a,b,c,a,b,c,a,b,c,a,b,c,a,b,c,a,b,c,a,b,c,a,b,c;
...
An associated sound to the animation could be (tick, tock, tack), (tick, tock, tack), ...
The row lengths of the above triangle are the terms of A011782 multiplied by 3, equaling the column 3 of the square array: 3, 3, 6, 12, 24, ...
.
For k = 4 consider A299476, the toothpick C.A. on triangular grid with word "abcb", so the structure of the irregular triangle of the first differences (A299477) is as follows:
a,b,c,b;
a,b,c,b;
a,b,c,b,a,b,c,b;
a,b,c,b,a,b,c,b,a,b,c,b,a,b,c,b;
a,b,c,b,a,b,c,b,a,b,c,b,a,b,c,b,a,b,c,b,a,b,c,b,a,b,c,b,a,b,c,b;
...
An associated sound to the animation could be (tick, tock, tack, tock), (tick, tock, tack, tock), ...
The row lengths of the above triangle are the terms of A011782 multiplied by 4, equaling the column 4 of the square array: 4, 4, 8, 16, 32, ...
.
For k = 5 consider A299478, the toothpick C.A. on triangular grid with word "abcbc", so the structure of the irregular triangle of the first differences (A299479) is as follows:
a,b,c,b,c;
a,b,c,b,c;
a,b,c,b,c,a,b,c,b,c;
a,b,c,b,c,a,b,c,b,c,a,b,c,b,c,a,b,c,b,c;
a,b,c,b,c,a,b,c,b,c,a,b,c,b,c,a,b,c,b,c,a,b,c,b,c,a,b,c,b,c,a,b,c,b,c,a,b,c,b,c;
...
An associated sound to the animation could be (tick, tock, tack, tock, tack), (tick, tock, tack, tock, tack), ...
The row lengths of the above triangle are the terms of A011782 multiplied by 5, equaling the column 5 of the square array: 5, 5, 10, 20, 40, ...

Thomas Grubb and Frederick Rajasekaran, Set Partition Patterns and the Dimension Index, arXiv:2009.00650 [math.CO], 2020. Mentions this sequence.
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to cellular automata
Index entries for sequences related to toothpick sequences

Cf. A011782, A147562, A147582, A139250, A139251, A160160, A160161, A296510, A296511, A296610, A296611, A299476, A299477, A299478, A299479.

T(n,k) = k*A011782(n), with n >= 0 and k >= 1.

A162795 Total number of toothpicks in the toothpick structure A139250 that are parallel to the initial toothpick, after n odd rounds.

Original entry on oeis.org

1, 5, 9, 21, 25, 37, 53, 85, 89, 101, 117, 149, 165, 201, 261, 341, 345, 357, 373, 405, 421, 457, 517, 597, 613, 649, 709, 793, 853, 965, 1173, 1365, 1369, 1381, 1397, 1429, 1445, 1481, 1541, 1621, 1637, 1673, 1733, 1817, 1877, 1989, 2197, 2389, 2405, 2441, 2501

Offset: 1

Omar E. Pol, Jul 14 2009

nonn

Partial sums of A162793.
Also, total number of ON cells at stage n of the two-dimensional cellular automaton defined as follows: replace every "vertical" toothpick of length 2 with a centered unit square "ON" cell, so we have a cellular automaton which is similar to both A147562 and A169707 (this is the "one-step bishop" version). For the "one-step rook" version we use toothpicks of length sqrt(2), then rotate the structure 45 degrees and then replace every toothpick with a unit square "ON" cell. For the illustration of the sequence as a cellular automaton we now have three versions: the original version with toothpicks, the one-step rook version and one-step bishop version. Note that the last two versions refer to the standard ON cells in the same way as the two versions of A147562 and the two versions of A169707. It appears that the graph of this sequence lies between the graphs of A147562 and A169707. Also, it appears that this sequence shares infinitely many terms with both A147562 and A169707, see Formula section and Example section. - Omar E. Pol, Feb 20 2015
It appears that this is also a bisection (the odd terms) of A255747.

			From _Omar E. Pol_, Feb 18 2015: (Start)
Written as an irregular triangle T(j,k), k>=1, in which the row lengths are the terms of A011782:
    1;
    5;
    9, 21;
   25, 37, 53, 85;
   89,101,117,149,165,201,261,341;
  345,357,373,405,421,457,517,597,613,649,709,793,853,965,1173,1365;
  ...
The right border gives the positive terms of A002450.
(End)
It appears that T(j,k) = A147562(j,k) = A169707(j,k), if k is a power of 2, for example: it appears that the three mentioned triangles only share the elements of the columns 1, 2, 4, 8, 16, ... - _Omar E. Pol_, Feb 20 2015

Michel Marcus, Table of n, a(n) for n = 1..10000
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

Cf. A002450, A048645, A139250, A139251, A147562, A153000, A159791, A159792, A160164, A160552, A162793, A162794, A162796, A162797, A169707, A255263, A255264, A255747.

It appears that a(n) = A147562(n) = A169707(n), if n is a term of A048645, otherwise A147562(n) < a(n) < A169707(n). - Omar E. Pol, Feb 20 2015
It appears that a(n) = (A169707(2n) - 1)/4 = A255747(2n-1). - Omar E. Pol, Mar 07 2015
a(n) = 1 + 4*A255737(n-1). - Omar E. Pol, Mar 08 2015

More terms from N. J. A. Sloane, Dec 28 2009

A194271 Number of toothpicks or D-toothpicks added at n-th stage to the structure of A194270.

Original entry on oeis.org

0, 1, 4, 8, 16, 22, 24, 22, 40, 40, 32, 32, 56, 74, 96, 50, 88, 72, 32, 48, 72, 104, 128, 112, 144, 144, 152, 96, 152, 178, 240, 122, 184, 136, 32, 48, 72, 108, 144, 144, 184, 188, 200, 176, 272, 274, 416, 250, 288, 272, 216, 144, 208, 292, 384, 332, 376

Offset: 0

Omar E. Pol, Aug 23 2011

nonn

Essentially the first differences of A194270.

			Written as a triangle:
0,
1,
4,
8,
16,22,
24,22,40,40,
32,32,56,74,96,50,88,72,
32,48,72,104,128,112,144,144,152,96,152,178,240,122,184,136,
32,48,72,108,144,144,184,188,200,176,272,274,416,250,288,...

David Applegate, The movie version
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to toothpick sequences

Cf. A010694, A129370, A139250, A139251, A172311, A182839, A194270, A194441, A194443, A194445.

a(n) = n^2-(n-1)^2*(1-(-1)^n)/8, if 0 <= n <=4.
Let b(n) = A194441(n), let c(n) = A194443(n), let d(n) = A010694(n), then:
Conjecture: a(n) = 4*(b(n-1)-d(n)) + 2*(c(n)-d(n+1)) + 2*(c(n+2)-d(n+1)) + 8, if n >= 3.
Conjecture: a(2^k+2) = 32, if k >= 3.

More terms from Omar E. Pol, Sep 01 2011

cp's OEIS Frontend

A153006 Toothpick sequence starting at the outside corner of an infinite square from which protrudes a half toothpick.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Formula

Extensions

A152980 First differences of toothpick corner sequence A153006.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A160121 First differences of A160120.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A160552 a(0)=0, a(1)=1; a(2^i+j) = 2*a(j) + a(j+1) for 0 <= j < 2^i.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A160406 Toothpick sequence starting at the vertex of an infinite 90-degree wedge.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A153000 Toothpick sequence in the first quadrant.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Python

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Formula