login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A265384 Toothpick sequence starting at the vertex of y=3*abs(x). 0
1, 2, 3, 5, 7, 9, 11, 13, 17, 21, 23, 25, 27, 31, 35, 39, 43, 47, 55, 63, 65, 67, 69, 73, 77, 81, 85, 89, 97, 105, 109, 113, 117, 125, 133, 141, 149, 157, 173, 189, 191, 193, 195, 199, 203, 207, 211, 215, 223, 231, 235, 239, 243, 251, 259, 267, 275, 283, 299, 315, 319, 323, 327, 335, 343, 351, 359, 367, 383, 399, 407, 415, 423, 439, 455, 471, 487, 503, 535, 567 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Consider the graph y=3*abs(x). The first toothpick extends vertically from (0,0) to (0,2). Each toothpick is of length 2 and is laid either horizontally or vertically.

Subsequent toothpicks are placed in a similar rule as A139250. Place toothpicks by the following rules:

- Toothpicks must always stay inside the graph of y=3*abs(x).

- Call the end of a toothpick exposed if it does not touch another toothpick, or the line y=3*abs(x)

- Each horizontal toothpick has its midpoint touching an exposed vertical toothpick

- If no horizontal toothpick can be laid, then a vertical toothpick should be laid on any exposed ends, from its end.

The sequence is the number of toothpicks laid after n rounds.

The structure is essentially the same as the Sierpinski's triangle but here every equilateral triangle is replaced with an isosceles triangle and then every isosceles triangle is replaced with seven toothpicks. There are infinitely many sequences of this type. - Omar E. Pol, Mar 12 2016

LINKS

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

Christopher J. Shore, Geogebra image of the toothpick sequence.

Index entries for sequences related to toothpick sequences

EXAMPLE

The pattern is the total number of toothpicks laid after n rounds.

Following the rules above, the first round has 1 toothpick, the second and third rounds also have 1 toothpick, but the fourth and fifth round both have 2 toothpicks. Finding the total toothpicks placed in this pattern (1,1,1,2,2) gives 1,2,3,5,7. Subsequent rounds have this same pattern repeated from the emerging branches thus:

(1,1,1,2,2) ---> 1,2,3,5,7

2*(1,1,1,2,2) ---> 9,11,13,17,21

2*((1,1,1,2,2),2*(1,1,1,2,2)) ---> 23,25,27,31,35,39,43,47,55,63

2*((1,1,1,2,2),2*(1,1,1,2,2),2*((1,1,1,2,2),2*(1,1,1,2,2))) ---> 65,67,69,73,77,81,85,89,97,105,109,113,117,125,133,141,149,157,173,189

Summation of 1*the sequence 1,1,1,2,2

  (1)=1

1+(1)=2

2+(1)=3

3+(2)=5

5+(2)=7

Summation of 2*the sequence 1,1,1,2,2

7+2(1)=9

9+2(1)=11

11+2(1)=13

13+2(2)=17

17+2(2)=21

Summation of 3*the sequence 1,1,1,2,2

21+2(1)=23

23+2(1)=25

25+2(1)=27

27+2(2)=31

31+2(2)=35

CROSSREFS

Cf. A047999, A151566, A139250.

Sequence in context: A328232 A189710 A024678 * A039786 A102422 A062427

Adjacent sequences:  A265381 A265382 A265383 * A265385 A265386 A265387

KEYWORD

nonn

AUTHOR

Christopher J. Shore, Dec 07 2015

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 August 13 04:54 EDT 2020. Contains 336442 sequences. (Running on oeis4.)