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 A160379 #18 Apr 20 2024 10:27:41 %S A160379 0,1,27,35,235,261,881,937,2241,2339,4591,4743,8207,8425,13365,13661, %T A160379 20341,20727,29411,29899,40851,41453,54937,55665,71945,72811,92151, %U A160379 93167,115831,117009,143261,144613,174717,176255,210475,212211,250811,252757,296001 %N A160379 Number of ON cells at n-th stage of three-dimensional version of the cellular automaton A160117 using cubes. %C A160379 Each cell has 26 neighbors. %H A160379 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 A160379 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 A160379 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a> %H A160379 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,3,-3,-3,3,1,-1). %F A160379 a(2n) = 46n^3 - 57n^2 + 57n - 19 for n>=1, a(2n+1) = 46n^3 - 51n^2 + 57n - 17 for n>=1. [_Nathaniel Johnston_, Nov 06 2010] %F A160379 G.f.: x*(18*x^3+x^2+26*x+1)*(x^4+4*x^2+1) / ((x-1)^4*(x+1)^3). - _Colin Barker_, Feb 28 2013 %Y A160379 Cf. A139250, A139251, A160117, A160118, A116119, A160160. %K A160379 nonn,easy %O A160379 0,3 %A A160379 _Omar E. Pol_, May 11 2009 %E A160379 Edited by _Omar E. Pol_, Sep 05 2009 %E A160379 a(6) - a(27) from _Nathaniel Johnston_, Nov 06 2010 %E A160379 a(28) - a(38) from _Colin Barker_, Feb 28 2013