The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A322056 First differences of A322055. 3
 1, 8, 32, 32, 72, 40, 136, 64, 192, 72, 232, 112, 304, 104, 328, 160, 416, 136, 424, 208, 528, 168, 520, 256, 640, 200, 616, 304, 752, 232, 712, 352, 864, 264, 808, 400, 976, 296, 904, 448, 1088, 328, 1000, 496, 1200, 360, 1096, 544, 1312, 392, 1192, 592, 1424 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Number of cells turned ON at generation n of the knight's-move cellular automaton described in A322055. This is another knight's-move version of the Ulam-Warburton cellular automaton (see A147562). LINKS Rémy Sigrist, Table of n, a(n) for n = 0..1000 N. J. A. Sloane, Illustration of a(0) to a(5). FORMULA Conjectures from Colin Barker, Dec 22 2018: (Start) G.f.: (1 + 8*x + 32*x^2 + 32*x^3 + 70*x^4 + 24*x^5 + 72*x^6 + 49*x^8 - 8*x^10 + 16*x^11 - 8*x^12) / ((1 - x)^2*(1 + x)^2*(1 + x^2)^2). a(n) = 2*a(n-4) - a(n-8) for n>8. (End) CROSSREFS Cf. A139250, A147562, A319018, A319019, A322055. Sequence in context: A299448 A300086 A115948 * A059880 A144096 A127988 Adjacent sequences:  A322053 A322054 A322055 * A322057 A322058 A322059 KEYWORD nonn AUTHOR N. J. A. Sloane, Dec 21 2018 EXTENSIONS More terms from Rémy Sigrist, Dec 22 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 30 18:40 EST 2021. Contains 349424 sequences. (Running on oeis4.)