|
%I #29 Feb 18 2023 09:34:18
%S 1,0,1,1,0,0,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,1,1,0,1,1,0,0,0,0,1,1,0,1,
%T 1,0,0,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,1,1,0,1,1,0,0,0,0,0,1,1,0,1,1,0,
%U 0,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,1,1,0,1,1,0,0,0,0,1,1,0,1,1,0,0,1,1,0,1,1
%N Duplicate of A079559.
%C Name was: Parity of positive integers of the toothpick sequence in the first quadrant A153000.
%C Same as A079559: reduce the g.f. of A153000 mod 2 to see this. [_Joerg Arndt_, Aug 07 2013]
%H 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 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 a(n) = A000035(A153000(n)). - _Omar E. Pol_, Aug 06 2013
%Y Cf. A040051, A079559, A139250, A153000
%K dead
%O 1,1
%A _Omar E. Pol_, Nov 29 2009
%E More terms from _R. J. Mathar_, Dec 04 2009
|
