login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Conjectured square array T(n,k) read by antidiagonals related to the existence of rectangles of size n*k in the toothpick structure of A139250.
0

%I #11 May 15 2013 02:04:35

%S 1,1,1,1,1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,

%T 1,1,0,1,1,1,0,1,1,1,0

%N Conjectured square array T(n,k) read by antidiagonals related to the existence of rectangles of size n*k in the toothpick structure of A139250.

%C For more information see Brian's article in the Links section.

%H Brian Hayes, <a href="http://bit-player.org/2013/joshua-trees-and-toothpicks">Joshua Trees and Toothpicks</a>

%H Brian Hayes, <a href="http://bit-player.org/extras/toothpicks/toothpicks.html">The Toothpick Sequence - Bit-Player</a>

%e Array begins:

%e 1,1,1,1,0,1,1,1,0,

%e 1,1,1,1,1,1,1,1,

%e 1,1,1,1,1,1,1,

%e 1,1,1,1,1,1,

%e 0,1,1,1,0,

%e 1,1,1,1,

%e 1,1,1,

%e 1,1,

%e 0

%Y Cf. A023758, A101082, A139250, A159786, A160124-A160126, A211008, A211012, A211016-A211019.

%K nonn,tabl,more

%O 1

%A _Omar E. Pol_, May 13 2013

%E Suggested by _Brian Hayes_, Feb 08 2013