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.
%I A161340 #18 Feb 24 2021 02:48:18 %S A161340 0,1,27,83,343,399,791,1183,3375,3431,3823,4215,6959,7351,10095,12839, %T A161340 29791,29847,30239,30631,33375,33767,36511,39255,58463,58855,61599, %U A161340 64343,83551,86295,105503,124711,250047,250103,250495,250887,253631,254023,256767,259511 %N A161340 Number of "ON" cells at n-th stage of three-dimensional version of the cellular automaton A160414 using cubes. %C A161340 For the first differences see A161341, where an explicit formula is given. %H A161340 Jinyuan Wang, <a href="/A161340/b161340.txt">Table of n, a(n) for n = 0..1000</a> %H A161340 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 A161340 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 A161340 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a> %F A161340 a(n) = (2n-1)^3 if n is a power of 2. %Y A161340 Cf. A000079, A000578, A139250, A160119, A160379, A160414, A160428, A161341. %K A161340 nonn %O A161340 0,3 %A A161340 _Omar E. Pol_, Jun 14 2009 %E A161340 Edited by _Omar E. Pol_, Sep 05 2009, Nov 21 2010 %E A161340 More terms from _Nathaniel Johnston_, Nov 15 2010 %E A161340 More terms from _Jinyuan Wang_, Mar 14 2020