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.

A323650 Flower garden sequence (see Comments for precise definition).

Original entry on oeis.org

0, 1, 3, 7, 15, 19, 27, 39, 63, 67, 75, 87, 111, 123, 147, 183, 255, 259, 267, 279, 303, 315, 339, 375, 447, 459, 483, 519, 591, 627, 699, 807, 1023, 1027, 1035, 1047, 1071, 1083, 1107, 1143, 1215, 1227, 1251, 1287, 1359, 1395, 1467, 1575, 1791, 1803, 1827, 1863, 1935, 1971, 2043, 2151, 2367, 2403, 2475
Offset: 0

Views

Author

Omar E. Pol, Jan 21 2019

Keywords

Comments

This arises from a hybrid cellular automaton on a triangular grid formed of I-toothpicks and V-toothpicks. Also, it appears that this is a missing link between A147562 (Ulam-Warburton) and three toothpick sequences: A139250 (normal toothpicks), A161206 (V-toothpicks) and A160120 (Y-toothpicks). The behavior resembles the toothpick sequence A139250, on the other hand, the formulas are directly related to A147562. Plot 2 shows that the graph is located between the graph of A139250 and the graph of A147562.
For the construction of the sequence the rules are as follows:
On the infinite triangular grid at stage 0 there are no toothpicks, so a(0) = 0.
At stage 1 we place an I-toothpick formed of two single toothpicks in vertical position, so a(1) = 1.
For the next n generation we have that:
If n is even then at every free end of the structure we add a V-toothpick formed of two single toothpicks such that the angle of each single toothpick with respect to the connected I-toothpick is 120 degrees.
If n is odd then we add I-toothpicks in vertical position (see the example).
a(n) gives the total number of I-toothpicks and V-toothpicks in the structure after the n-th stage.
A323651 (the first differences) gives the number of elements added at the n-th stage.
Note that 2*a(n) gives the total number of single toothpicks of length 1 after the n-th stage.
The structure contains only three kinds of polygonal regions as follows:
- Rhombuses that contain two triangular cells.
- Regular hexagons that contain six triangular cells.
- Oblong hexagons that contain 10 triangular cells.
The structure looks like a "garden of flowers with six petals" (between other substructures). In particular, after 2^(n+1) stages with n >= 0, the structure looks like a flower garden in a rectangular box which contains A002450(n) flowers with six petals.
Note that this hybrid cellular automaton is also a superstructure of the Ulam-Warburton cellular automaton (at least in four ways). The explanation is as follows:
1) A147562(n) equals the total number of I-toothpicks in the structure after 2*n - 1 stage, n >= 1.
2) A147562(n) equals the total number of pairs of Y-toothpicks connected by their endpoints in the structure after 2*n stage (see the example).
3) A147562(n) equals the total number of "flowers with six petals" (or six-pointed stars formed of six rhombuses) in the structure after 4*n stage. Note that the location of the "flowers with six petals" in the structure is essentially the same as the location of the "ON" cells in the version "one-step bishop" of A147562.
4) For more connections to A147562 see the Formula section.
The "word" of this cellular automaton is "ab". For more information about the word of cellular automata see A296612.
The total number of “flowers with six petals” after n-th stage equals the total number of “hidden crosses” after n-th stage in the toothpick structure of A139250, including the central cross (beginning to count the crosses when their “nuclei” are totally formed with 4 quadrilaterals). - Omar E. Pol, Mar 06 2019

Examples

			Illustration of initial terms:
.
                        |   |
                \ /     |\ /|
         |       |        |
         |       |        |
                / \     |/ \|
                        |   |
n        1       2        3
a(n)     1       3        7
.
Note that for n = 2 the structure is also the same as a pair of Y-toothpicks connected by their endpoints (see A160120).

Links

Crossrefs

Cf. A002450, A103454, A139250 (normal toothpicks), A147562 (Ulam-Warburton), A147582, A160120 (Y-toothpicks), A161206 (V-toothpicks), A296612, A323641, A323642, A323649 (corner sequence), A323651 (first differences).
For other hybrid cellular automata, see A194270, A194700, A220500, A289840, A290220, A294020, A294962, A294980, A299770.

Programs

Formula

a(n) = 3*A147562(n/2) if n is even.
a(n) = 3*A147562((n-1)/2) + A147582(n) if n is odd.
a(n) = 3*A147562((n-1)/2) + A147562(n) - A147562(n-1) if n is odd.
a(2^n) = A103454(n), n >= 0.

A103452 Inverse of number triangle A103451.

Original entry on oeis.org

1, -1, 1, -1, 0, 1, -1, 0, 0, 1, -1, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
Offset: 0

Views

Author

Paul Barry, Feb 06 2005

Keywords

Comments

Triangle T(n,k), 0 <= k <= n, read by rows given by [ -1, 2, 0, 0, 0, 0, 0, ...] DELTA [1, 0, -1/2, 1/2, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938. - Philippe Deléham, May 01 2007

Examples

			Triangle begins
   1;
  -1, 1;
  -1, 0, 1;
  -1, 0, 0, 1;
  -1, 0, 0, 0, 1;
  -1, 0, 0, 0, 0, 1;
  -1, 0, 0, 0, 0, 0, 1;
  -1, 0, 0, 0, 0, 0, 0, 1;
  -1, 0, 0, 0, 0, 0, 0, 0, 1;
  -1, 0, 0, 0, 0, 0, 0, 0, 0, 1;
  -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
Production matrix begins
  -1, 1;
  -2, 1, 1;
  -2, 1, 0, 1;
  -2, 1, 0, 0, 1;
  -2, 1, 0, 0, 0, 1;
  -2, 1, 0, 0, 0, 0, 1;
  -2, 1, 0, 0, 0, 0, 0, 1;
  -2, 1, 0, 0, 0, 0, 0, 0, 1;

Links

Crossrefs

Cf. A000007 (row sums), A103453, A103454, A103455.

Programs

Formula

T(n,k) = 1 if k = n, -1 if k = 0, otherwise 0.
Sum_{k=0..n} T(n, k) = 0^n (row sums).
Sum_{k=0..floor(n/2)} T(n-k, k) = 0^n - (1-(-1)^n)/2 (diagonal sums).
G.f.: (1 - 2*x + y*x^2)/((1-x)*(1-y*x)). - Philippe Deléham, Feb 11 2012

A267596 Decimal representation of the n-th iteration of the "Rule 173" elementary cellular automaton starting with a single ON (black) cell.

Original entry on oeis.org

1, 2, 15, 63, 255, 1023, 4095, 16383, 65535, 262143, 1048575, 4194303, 16777215, 67108863, 268435455, 1073741823, 4294967295, 17179869183, 68719476735, 274877906943, 1099511627775, 4398046511103, 17592186044415, 70368744177663, 281474976710655
Offset: 0

Views

Author

Robert Price, Jan 18 2016

Keywords

Links

Crossrefs

Cf. A267594, A267595.

Programs

  • Mathematica
    rule=173; rows=20; ca=CellularAutomaton[rule,{{1},0},rows-1,{All,All}]; (* Start with single black cell *) catri=Table[Take[ca[[k]],{rows-k+1,rows+k-1}],{k,1,rows}]; (* Truncated list of each row *) Table[FromDigits[catri[[k]],2],{k,1,rows}]   (* Decimal Representation of Rows *)

Formula

Conjectures from Colin Barker, Jan 18 2016 and Apr 20 2019: (Start)
a(n) = 5*a(n-1)-4*a(n-2) for n>3.
G.f.: (1-3*x+9*x^2-4*x^3) / ((1-x)*(1-4*x)).
(End)
Empirical a(n) = 4^n - 1 = A103454(n) = A024036(n) for n>1. - Colin Barker, Nov 25 2016 and Apr 20 2019
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.