login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182618 Number of new grid points that are covered by the toothpicks added at n-th-stage to the toothpick spiral of A182617. 3
6, 4, 3, 3, 3, 3, 2, 3, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

In the toothpick spiral the toothpicks are connected by their endpoints. See A182617 for more information.

Attempt at an explanation, R. J. Mathar, Dec 13 2010: (Start)

In the hexagonal grid, we can pick any of the hexagons as a center, and then define a ring of 6 first neighbors (hexagons adjacent to the center), then define a ring of 12 second neighbors (hexagons adjacent to any of the first ring) and so on. The current sequence describes a self-avoiding walk which starts in a spiral around the center hexagon, which covers 5 edges. The walk then takes one step to reach the rim of the first ring and travels once around this ring until it reaches a point where self-avoidance stops it. It then takes one step to reach the rim of the second ring and walks around that one, etc. Imagine that on each edge we place a toothpick if it's on the path, and interrupt counting the total number of toothpicks each time one of the hexagons has six vertices covered. The first differences of these intermediate totals define the sequence. (End)

LINKS

Table of n, a(n) for n=1..76.

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

EXAMPLE

At stage 1, starting from a node on the hexagonal net, we place 5 toothpicks on 5 edges of the first hexagon, so a(1)= 6 because there are 6 grid points that are covered by the toothpicks.

At stage 2, starting from the last exposed endpoints, we place 4 toothpicks on the edges of the second hexagon, so a(2)=4 because there are new 4 grid points that are covered by the toothpicks.

At stage 3, starting from the last exposed endpoints we place 3 toothpicks on the edges of the third hexagon, so a(3)=3 because there are new 3 grid points covered. Etc.

If written as a triangle, begins:

6,

4,3,3,3,3,2,

3,3,2,3,2,3,2,3,2,3,2,2,

3,2,3,2,2,3,2,2,3,2,2,3,2,2,3,2,2,2,

3,2,2,3,2,2,2,3,2,2,2,3,2,2,2,3,2,2,2,3,2,2,2,2,

3,2,2,2,3,2,2,2,2,3,2,2,2,2,3,2,2,2,2,3,2,2,2,2,3,2,2,2,2,2

CROSSREFS

Cf. A121149, A139250, A139251, A182617, A182619, A182632, A182840.

Row n has A008458(n-1) terms. Row sums give A017593.

Sequence in context: A329081 A155044 A245634 * A118227 A199429 A235509

Adjacent sequences:  A182615 A182616 A182617 * A182619 A182620 A182621

KEYWORD

nonn,tabf

AUTHOR

Omar E. Pol, Dec 12 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 03:06 EST 2019. Contains 329216 sequences. (Running on oeis4.)