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

Author

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

Keywords

• nonn

Comments

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

Links

• 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

Crossrefs

Cf. A000079, A000217, A000396, A000668, A139250, A139251, A139560, A152978, A152979, A152980, A153000, A153001, A153002.

Cf. A000225, A006516.

Cf. A153007, A078008, A151555.

Programs

Maple

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

Formula

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

Extensions

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