cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A163311 Triangle read by rows in which the diagonals give the infinite set of Toothpick sequences.

This page as a plain text file.
%I A163311 #20 Feb 24 2021 02:48:18
%S A163311 1,1,2,1,3,4,1,4,7,5,1,5,10,11,7,1,6,13,19,15,10,1,7,16,29,25,23,13,1,
%T A163311 8,19,41,37,40,35,14,1,9,22,55,51,61,67,43,16,1,10,25,71,67,86,109,94,
%U A163311 47,19,1,11,28,89,85,115,161,173,100,55,22,1,12,31,109,105,148,223,286,181
%N A163311 Triangle read by rows in which the diagonals give the infinite set of Toothpick sequences.
%C A163311 Apart from the second diagonal (which gives the toothpick sequence A139250), the rest of the diagonals cannot be represented with toothpick structures. - _Omar E. Pol_, Dec 14 2016
%H A163311 David Applegate, Omar E. Pol and N. J. A. Sloane, <a href="/A000695/a000695_1.pdf">The Toothpick Sequence and Other Sequences from Cellular Automata</a>, 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.]
%H A163311 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>
%F A163311 See A162958 for rules governing the generation of N-th Toothpick sequences. By way of example, (N+2), A139250. The generator is A160552, which uses the multiplier "2". Then A160552 convolved with (1, 2, 2, 2,...) = A139250 the Toothpick sequence for N=2. Similarly, we create an array for Toothpick sequences N=1, 2, 3,...etc = A163267, A139250, A162958,...; then take the antidiagonals, creating triangle A163311.
%e A163311 Triangle begins:
%e A163311 1;
%e A163311 1, 2;
%e A163311 1, 3,  4;
%e A163311 1, 4,  7,  5;
%e A163311 1, 5,  10, 11,  7;
%e A163311 1, 6,  13, 19,  15,  10;
%e A163311 1, 7,  16, 29,  25,  23,  13;
%e A163311 1, 8,  19, 41,  37,  40,  35,  14;
%e A163311 1, 9,  22, 55   51,  61,  67,  43,  16;
%e A163311 1, 10, 25, 71,  67,  86,  109, 94,  47,  19;
%e A163311 1, 11, 28, 89,  85,  115, 161, 173, 100, 55,  22;
%e A163311 1, 12, 31, 109, 105, 148, 223, 286, 181, 115, 67,  25;
%e A163311 1, 13, 34, 131, 127, 185, 295, 439, 296, 205, 142, 79,  30;
%e A163311 1, 14, 37, 155, 151, 226, 377, 638, 451, 331, 253, 175, 95, 36;
%e A163311 ...
%Y A163311 Row sums = A163312: (1, 3, 8, 17, 34, 64,...).
%Y A163311 Right border = A163267, toothpick sequence for N=1.
%Y A163311 Next diagonal going to the left = A139250, toothpick sequence for N=2.
%Y A163311 Then 1, 4, 10, 19,... = A162958, toothpick sequence for N=3.
%Y A163311 Cf. A160552, A162958, A163311, A163312.
%K A163311 nonn,tabl
%O A163311 1,3
%A A163311 _Gary W. Adamson_, Jul 24 2009