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.

A194441 Number of toothpicks or D-toothpicks added at n-th stage to the structure of A194440.

This page as a plain text file.
%I A194441 #21 Mar 29 2013 05:31:59
%S A194441 0,1,2,4,4,4,4,8,8,4,4,8,12,16,8,16,16,4,4,8,12,16,16,24,26,24,12,20,
%T A194441 28,40,20,32,32,4,4,8,12,16,16,24,26,24,20,32,40,64,40,48,54,40,12,20,
%U A194441 32,48,48,64,70,76,30,44,64,88,44,64,64,4,4,8,12
%N A194441 Number of toothpicks or D-toothpicks added at n-th stage to the structure of A194440.
%C A194441 Essentially the first differences of A194440.
%H A194441 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>
%H A194441 <a href="/index/To#toothpick">Index entries for sequences related to toothpick sequences</a>
%F A194441 Conjectures for n = 2^k+j, if -1<=j<=3:
%F A194441 a(2^k-1) = 2^k, if k >= 2.
%F A194441 a(2^k+0) = 2^k, if k >= 0.
%F A194441 a(2^k+1) = 4, if k >= 1.
%F A194441 a(2^k+2) = 4, if k >= 1.
%F A194441 a(2^k+3) = 8, if k >= 2.
%F A194441 End of conjectures.
%e A194441 If written as a triangle:
%e A194441 0,
%e A194441 1,
%e A194441 2,
%e A194441 4,4,
%e A194441 4,4,8,8,
%e A194441 4,4,8,12,16,8,16,16,
%e A194441 4,4,8,12,16,16,24,26,24,12,20,28,40,20,32,32,
%e A194441 4,4,8,12,16,16,24,26,24,20,32,40,64,40,48,54,40,12,20,...
%e A194441 .
%e A194441 It appears that rows converge to A194696.
%Y A194441 Cf. A139251, A160121, A160407, A161831, A194271, A194440, A194443, A194445, A194692, A194693, A194696.
%K A194441 nonn
%O A194441 0,3
%A A194441 _Omar E. Pol_, Aug 29 2011
%E A194441 More terms from _Omar E. Pol_, Dec 28 2012