A151555 G.f.: (1 + 2x) * Product_{n>=1} (1 + x^(2^n-1) + 2*x^(2^n)).
1, 3, 4, 5, 5, 10, 12, 9, 5, 10, 13, 15, 20, 32, 32, 17, 5, 10, 13, 15, 20, 32, 33, 23, 20, 33, 41, 50, 72, 96, 80, 33, 5, 10, 13, 15, 20, 32, 33, 23, 20, 33, 41, 50, 72, 96, 81, 39, 20, 33, 41, 50, 72, 97, 89, 66, 73, 107, 132, 172, 240, 272, 192, 65, 5, 10, 13, 15, 20, 32, 33, 23
Offset: 0
Keywords
Examples
From _Omar E. Pol_, Jun 19 2009: (Start) May be written as a triangle: 1; 3; 4,5; 5,10,12,9; 5,10,13,15,20,32,32,17; 5,10,13,15,20,32,33,23,20,33,41,50,72,96,80,33; 5,10,13,15,20,32,33,23,20,33,41,50,72,96,81,39,20,33,41,50,72,97,89,66,73,... (End)
Links
- N. J. A. Sloane, Table of n, a(n) for n = 0..16384
- David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, 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.]
- N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Comments