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.

Showing 1-3 of 3 results.

A267700 "Tree" sequence in a 90-degree sector of the cellular automaton of A160720.

Original entry on oeis.org

0, 1, 2, 5, 6, 9, 12, 19, 20, 23, 26, 33, 36, 43, 50, 65, 66, 69, 72, 79, 82, 89, 96, 111, 114, 121, 128, 143, 150, 165, 180, 211, 212, 215, 218, 225, 228, 235, 242, 257, 260, 267, 274, 289, 296, 311, 326, 357, 360, 367, 374, 389, 396, 411, 426, 457, 464, 479, 494, 525, 540, 571, 602, 665, 666, 669, 672, 679, 682, 689
Offset: 0

Views

Author

Omar E. Pol, Jan 19 2016

Keywords

Comments

Conjecture: this is also the "tree" sequence in a 120-degree sector of the cellular automaton of A266532.
It appears that this is also the partial sums of A038573.
a(n) is also the total number of ON cells after n-th stage in the tree that arises from one of the four spokes in a 90-degree sector of the cellular automaton A160720 on the square grid.
Note that the structure of A160720 is also the "outward" version of the Ulam-Warburton cellular automaton of A147562.
It appears that A038573 gives the number of cells turned ON at n-th stage.
Conjecture: a(n) is also the total number of Y-toothpicks after n-th stage in the tree that arises from one of the three spokes in a 120-degree sector of the cellular automaton of A266532 on the triangular grid.
Note that the structure of A266532 is also the "outward" version of the Y-toothpick cellular automaton of A160120.
It appears that A038573 also gives the number of Y-toothpicks added at n-th stage.
Comment from N. J. A. Sloane, Jan 23 2016: All the above conjectures are true!
From Gus Wiseman, Mar 31 2019: (Start)
a(n) is also the number of nondecreasing binary-containment pairs of positive integers up to n. A pair of positive integers is a binary containment if the positions of 1's in the reversed binary expansion of the first are a subset of the positions of 1's in the reversed binary expansion of the second. For example, the a(1) = 1 through a(6) = 12 pairs are:
(1,1) (1,1) (1,1) (1,1) (1,1) (1,1)
(2,2) (1,3) (1,3) (1,3) (1,3)
(2,2) (2,2) (1,5) (1,5)
(2,3) (2,3) (2,2) (2,2)
(3,3) (3,3) (2,3) (2,3)
(4,4) (3,3) (2,6)
(4,4) (3,3)
(4,5) (4,4)
(5,5) (4,5)
(4,6)
(5,5)
(6,6)
(End)

Crossrefs

Programs

  • Mathematica
    Accumulate[Table[2^DigitCount[n,2,1]-1,{n,0,30}]] (* based on conjecture confirmed by Sloane, Gus Wiseman, Mar 31 2019 *)

Formula

a(n) = (A160720(n+1) - 1)/4.
Conjecture 1: a(n) = (A266532(n+1) - 1)/3.
Conjecture 2: a(n) = A160720(n+1) - A266532(n+1).
All of the above conjectures are true. - N. J. A. Sloane, Jan 23 2016
(Conjecture) a(n) = A267610(n) + n. - Gus Wiseman, Mar 31 2019

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

Original entry on oeis.org

0, 1, 2, 3, 6, 7, 10, 13, 16, 21, 24, 29, 36, 37, 40, 43, 46, 53, 58, 65, 74, 83, 96, 107, 120, 133, 136, 143, 150, 157, 168, 179, 190, 209, 226, 247, 258, 271, 286, 299, 314, 327, 334, 349, 364, 381, 406, 417, 434, 455, 470, 493, 514, 533, 562, 583, 608, 631, 646, 661, 680, 703, 736, 761, 782, 807, 836, 857, 892, 927
Offset: 0

Views

Author

Omar E. Pol, Jan 12 2016

Keywords

Comments

The structure looks like a tree which arises from one of the four spokes of the structure of the cellular automaton of A151895.
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 (snowflake tree) at a(16).
First differs from A266536 at a(13). - Omar E. Pol, Apr 02 2016

Crossrefs

Formula

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

Extensions

More terms from Omar E. Pol, Apr 02 2016

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.
Showing 1-3 of 3 results.