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.

A194693 Number of toothpicks or D-toothpicks added at n-th stage to the D-toothpick "corner" structure of A194692.

This page as a plain text file.
%I A194693 #20 Sep 26 2015 01:17:13
%S A194693 2,2,4,6,8,8,12,13,12,10,16,20,32,20,24,27,20,10,16,24,36,41,48,48,54,
%T A194693 34,44,50,80,48,48,55,36,10,16,24,36,41,48,54,68,62,80,80,124,95,104,
%U A194693 89,94,44,48,68
%N A194693 Number of toothpicks or D-toothpicks added at n-th stage to the D-toothpick "corner" structure of A194692.
%C A194693 Sequence related to the D-toothpick "wide" triangle (See A194440 and A194441). First differences of A194692.
%H A194693 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 A194693 <a href="/index/To#toothpick">Index entries for sequences related to toothpick sequences</a>
%F A194693 a(n) = A194696(n)/2.
%F A194693 Conjectures for n = 2^k+j, if 0<=j<=3:
%F A194693 a(2^k) = 7*2^(k-2)-1, if k >= 2.
%F A194693 a(2^k+1) = 2^k+4, if k >= 2.
%F A194693 a(2^k+2) = 10, if k >= 3.
%F A194693 a(2^k+3) = 16, if k >= 3.
%F A194693 End conjectures.
%e A194693 Written as a triangle:
%e A194693 2,
%e A194693 2,
%e A194693 4,
%e A194693 6,8,
%e A194693 8,12,13,12,
%e A194693 10,16,20,32,20,24,27,20,
%e A194693 10,16,24,36,41,48,48,54,34,44,50,80,48,48,55,36,
%e A194693 10,16,24,36,41,48,54,68,62,80,80,124,95,104,89,94,44,...
%Y A194693 Cf. A086224, A152980, A194271, A194440, A194441, A194692, A194695, A194696
%K A194693 nonn,more
%O A194693 1,1
%A A194693 _Omar E. Pol_, Sep 03 2011