cp's OEIS Frontend

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.

A293392 Total number of ON cells after n-th stage in a 90-degree sector of the cellular automaton of A267190.

Original entry on oeis.org

0, 1, 2, 3, 6, 7, 10, 13, 16, 21, 24, 29, 36, 37, 40, 43, 48, 55, 60, 69, 78, 89, 100, 109, 122, 135, 138, 145, 152, 161, 172, 183, 200, 217, 236, 255, 270, 287, 304, 319, 336, 349, 358, 375, 392, 413, 438, 457, 476, 499, 514, 535, 556, 579, 612, 637, 670, 699, 722, 741, 760, 787, 822, 847, 872, 897, 930, 953, 992
Offset: 0

Views

Author

Omar E. Pol, Oct 08 2017

Keywords

Comments

The structure looks like a tree which arises from one of the four spokes of the structure of the cellular automaton of A267190.
a(n) is the total number of ON cells after n-th stage.
For n >> 1 the structure looks like a square which is rotated 45 degrees.
First differs from A161336 at a(17), where A161336 is a version of A161330 (the snowflake cellular automaton).
First differs from A266534 at a(16), where A266534 is a version of A151895.
First differs from A266536 at a(13), where A266536 is a version of A170896 (the Schrandt-Ulam cellular automaton).
From Omar E. Pol, Oct 16 2017: (Start)
The graph of both A266536 and this sequence are very similar.
For n >> 1, it appears that A266534(n) < A161336(n) < a(n) < A266536(n).
The graphs of these four sequences are similar, and the behavior looks like percolation.
It appears that there are no recurrences in these four sequences. Thus it appears that there are no recurrences in A151895, A161330, A267190 and A170896. (End)

Crossrefs

Formula

a(n) = (A267190(n+1) - 1)/4.