%I
%S 0,1,3,5,7,11,15,17,19,23,27,31,39,51,59,61,63,67,71,75,83,95,103,107,
%T 115,127,139,155,183,215,231,233,235,239,243,247,255,267,275,279,287,
%U 299,311,327,355,387,403,407,415
%N Number of segments needed to draw the toothpick structure of A139250 as it is after n stages.
%C Contribution from _Omar E. Pol_, Sep 16 2012 (Start):
%C It appears that A147614(n)/a(n) converge to 4.
%C It appears that A139250(n)/a(n) converge to 3.
%C It appears that A160124(n)/a(n) converge to 2.
%C (End)
%H Nathaniel Johnston, <a href="/A139252/b139252.txt">Table of n, a(n) for n = 0..256</a>
%H David Applegate, Omar E. Pol and N. J. A. Sloane, <a href="http://neilsloane.com/doc/tooth.pdf">The Toothpick Sequence and Other Sequences from Cellular Automata</a>, Congressus Numerantium, Vol. 206 (2010), 157191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n1)1) for n >= 2.]
%H Nathaniel Johnston, <a href="/A139252/a139252.c.txt">C script for computing table of terms</a>
%H N. J. A. Sloane, <a href="/wiki/Catalog_of_Toothpick_and_CA_Sequences_in_OEIS">Catalog of Toothpick and Cellular Automata Sequences in the OEIS</a>
%e For n = 3, after three stages the toothpick structure of A139250 contains seven toothpicks (A139250(3) = 7), however the toothpick structure can be essentially represented by five segments, so a(3) = 5.  _Omar E. Pol_, Sep 16 2012
%Y Cf. A139250, A139251, A139253, A147614, A160124, A139254, A139255, A160128.
%K nonn
%O 0,3
%A _Omar E. Pol_, May 17 2008
%E Terms after a(28) from _Nathaniel Johnston_, Mar 29 2011
