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-5 of 5 results.

A347186 Ziggurat sequence (see Comments lines for definition).

Original entry on oeis.org

1, 4, 6, 16, 12, 37, 20, 64, 36, 90, 42, 161, 56, 156, 107, 256, 90, 334, 110, 408, 202, 342, 156, 697, 207, 462, 312, 785, 240, 976, 272, 1024, 446, 756, 441, 1586, 380, 930, 604, 1736, 462, 1841, 506, 1806, 1101, 1332, 600, 2921, 720, 1820, 992, 2450, 756, 2998, 1108, 3257
Offset: 1

Views

Author

Omar E. Pol, Aug 21 2021

Keywords

Comments

What do the parts and subparts of the symmetric representation of sigma(n) represent? (cf. A237270, A280851). This sequence gives an answer.
To calculate a(n) we must follow a geometric algorithm composed of three stages as follows:
Stage 1 (Construction):
On the infinite square grid we draw the diagram called "double-staircases" with n levels described in A335616.
Then we label the double-staircases from left to right starting from k = 1 to the central column of the diagram.
Note that k is also the difference in height between two steps of the ladder it would have if we drew it with more than one step.
Stage 2 (Debugging):
We remove all double-staircases that do not have at least one step at the level 1 of the diagram starting from the base.
Now the number of steps in the k-th double-staircase is equal to A196020(n,k).
Stage 3 (Annihilation):
From left to right, we remove each even-indexed double-staircase along with the steps of the nearest odd-indexed double-staircase that are just above it.
As a result of this geometric algorithm a diagram is obtained which can have only double-staircases, only simple-staircases, or both at the same time.
We call double-staircases those that have a step in the central column of the diagram. The rest are simple-staircases forming one or more symmetrical pairs equidistant from the central column of the diagram.
We call "parts" of the diagram to the staircases (and the cells below them) that are separated from each other by columns of zero height.
We call "subparts" of the diagram to the polygons formed by the cells that are under the staircases.
a(n) is the total area (or the total number of cells) under all the staircases, with multiplicity.
The connection with the polygonal numbers is as follows:
The area under a double-staircase labeled with the number k is equal to the m-th (k+2)-gonal number plus the (m-1)-th (k+2)-gonal number, where m is the number of steps on one side of the ladder from the base to the top.
If k = 1 then the area under the double-staircase is also equal to n^2 = A000290(n).
The area under a simple-staircase labeled with the number k is equal to the m-th (k+2)-gonal number, where m is the number of steps.
If n is a power of 2, or if n is an odd prime number, or if n is an even perfect number, or if n is a member of A246955, then the calculation of a(n) is easy (see the Formula section).
The connection with the symmetric representation of sigma(n) or "SRS(n)" is as follows:
The total number of steps in the diagram is equal to A000203(n), equaling the total area (or the number of cells) in the SRS(n).
The number of parts in the diagram is equal to A237271(n) equaling the number of parts in the SRS(n).
The number of double-staircases (also the number of steps in the central column in the diagram) is equal to A067742(n), equaling the number of central subparts in the SRS(n).
The number of simple-staircases is equal to A281009(n), equaling the total number of equidistant subparts in the SRS(n).
The total number of staircases is equal to A001227(n), equaling the number of subparts in the SRS(n).
The number of columns in the diagram is equal to 2*n - 1, equaling the number of "widths" in the SRS(n) (cf. A249351).
The number of steps in the successive parts of the diagram gives the n-th row of triangle A237270, equaling the successive parts in the SRS(n).
The number of steps in the successive staircases from left to right gives the n-th row of triangle A280851, equaling the successive subparts from left to right in the SRS(n).
The diagram is essentially the front view of a three-dimensional structure whose base is the symmetric representation of sigma(n), so a(n) is also the total number of cubic cells (or cubes) in the structure.
The number of polycubes in the structure is equal to A237271(n), equaling the number of parts in the SRS(n).
For some values of n the three-dimensional structure resembles a "ziggurat" which is a type of massive structure built in ancient Mesopotamia.
It appears that the geometric algorithm described here is equivalent to the numerical algorithm conjectured in A280850 in the sense that both allow the value of the subparts of the SRS(n) to be computed.
Both algorithms would also be equivalent to the geometric transformation of the isosceles triangle described in A237593 which, when folded, transforms into the vertical faces of the structure of the stepped pyramid described in A245092.
Note that the stage 2 (Debugging) is in correspondence with the formula A196020(n,k) = A237048(n,k)*A338721(n,k) which transform the triangle A338721 into the triangle A196020. - Omar E. Pol, Jun 23 2022

Examples

			Illustration of the geometric algorithm and the initial terms (n = 1..6):
-------------------------------------------------------------------------------
          Stage 1                  Stage 2                  Stage 3
      (Construction)             (Debugging)            (Annihilation)
-------------------------------------------------------------------------------
     Double-staircases           Diagram of                Ziggurat
n         diagram                  A196020                  diagram        a(n)
-------------------------------------------------------------------------------
             _                        _                        _
1           |_|                      |_|                      |_|            1
            1                        1                        1
.
             _                        _                        _
           _| |_                    _| |_                    _| |_
2         |_ _ _|                  |_ _ _|                  |_ _ _|          4
          1                        1                        1
.
             _                        _
           _| |_                    _| |_                    _   _
         _|  _  |_                _|  _  |_                _| | | |_
3       |_ _|_|_ _|              |_ _|_|_ _|              |_ _|_|_ _|        6
        1   2                    1   2                    1
.
             _                        _                        _
           _| |_                    _| |_                    _| |_
         _|  _  |_                _|     |_                _|     |_
       _|   | |   |_            _|         |_            _|         |_
4     |_ _ _|_|_ _ _|          |_ _ _ _ _ _ _|          |_ _ _ _ _ _ _|     16
      1     2                  1                        1
.
             _                        _
           _| |_                    _| |_
         _|  _  |_                _|  _  |_                _       _
       _|   | |   |_            _|   | |   |_            _| |     | |_
     _|    _| |_    |_        _|    _| |_    |_        _|   |     |   |_
5   |_ _ _|_ _ _|_ _ _|      |_ _ _|_ _ _|_ _ _|      |_ _ _|_ _ _|_ _ _|   12
    1     2                 1      2                  1
.
             _                        _                        _
           _| |_                    _| |_                    _| |_
         _|  _  |_                _|     |_                _|     |_
       _|   | |   |_            _|         |_            _|         |_
     _|    _| |_    |_        _|             |_        _|             |_
   _|     |  _  |     |_    _|        _        |_    _|        _        |_
6 |_ _ _ _|_|_|_|_ _ _ _|  |_ _ _ _ _|_|_ _ _ _ _|  |_ _ _ _ _|_|_ _ _ _ _| 37
  1       2 3              1         3              1         3
.
For n = 7..14 the examples are omitted.
For n = 15 the illustration of the geometric algorithm is as follows:
Stage 1 (Construction):
We draw the diagram called "double-staircases" with 15 levels described in A335616.
Then we label the five double-staircases (k = 1..5) as shown below:
                               _
                             _| |_
                           _|  _  |_
                         _|   | |   |_
                       _|    _| |_    |_
                     _|     |  _  |     |_
                   _|      _| | | |_      |_
                 _|       |   | |   |       |_
               _|        _|  _| |_  |_        |_
             _|         |   |  _  |   |         |_
           _|          _|   | | | |   |_          |_
         _|           |    _| | | |_    |           |_
       _|            _|   |   | |   |   |_            |_
     _|             |     |  _| |_  |     |             |_
   _|              _|    _| |  _  | |_    |_              |_
  |_ _ _ _ _ _ _ _|_ _ _|_ _|_|_|_|_ _|_ _ _|_ _ _ _ _ _ _ _|
  1               2     3   4 5
.
Stage 2 (Debugging):
We remove the fourth double-staircase as it does not have at least one step at level 1 of the diagram starting from the base, as shown below:
                               _
                             _| |_
                           _|  _  |_
                         _|   | |   |_
                       _|    _| |_    |_
                     _|     |  _  |     |_
                   _|      _| | | |_      |_
                 _|       |   | |   |       |_
               _|        _|  _| |_  |_        |_
             _|         |   |     |   |         |_
           _|          _|   |     |   |_          |_
         _|           |    _|     |_    |           |_
       _|            _|   |         |   |_            |_
     _|             |     |         |     |             |_
   _|              _|    _|    _    |_    |_              |_
  |_ _ _ _ _ _ _ _|_ _ _|_ _ _|_|_ _ _|_ _ _|_ _ _ _ _ _ _ _|
  1               2     3     5
.
Note that the number of steps in the successive double-staircases gives [29, 13, 7, 0, 1], the same as the 15th row of triangle A196020 (whose alternate sums equals sigma(15) = A000203(15) = 24).
Stage 3 (Annihilation):
We delete the second double-staircase and the steps of the first double-staircase that are just above the second double-staircase.
As a result of this geometric algorithm a new diagram is obtained which in this case has two double-staircases and two simple-staircases as shown below:
                               _
                              | |
                 _            | |            _
               _| |          _| |_          | |_
             _|   |         |     |         |   |_
           _|     |         |     |         |     |_
         _|       |        _|     |_        |       |_
       _|         |       |         |       |         |_
     _|           |       |         |       |           |_
   _|             |      _|    _    |_      |             |_
  |_ _ _ _ _ _ _ _|_ _ _|_ _ _|_|_ _ _|_ _ _|_ _ _ _ _ _ _ _|
  1                     3     5
.
The diagram is called here "ziggurat of order 15".
Now we calculate the total area (or the total number of cells) under the staircases with multiplicity using polygonal numbers as shown below:
The area under the staircase labeled 1 is equal to A000217(8) = 36. There are a pair of this staircases, so the total area of this pair is equal to 2*36 = 72.
The area under the double-staircase labeled 3 is equal to A000326(4) + A000326(3) = 22 + 12 = 34.
The area under the double-staircase labeled 5 is equal to A000566(1) + A000566(0) = 1 + 0 = 1.
Therefore the total area is a(15) = 72 + 34 + 1 = 107.
The connection with the symmetric representation of sigma(15) or "SRS(15)" is as follows:
The total number of steps is equal to A000203(15) = 24, equaling the total area (or number of cells) in the SRS(15).
The number of parts in the diagram is equal to A237271(15) = 3 equaling the number of parts in the SRS(15).
The number of double-staircases (also the number of steps in the central column in the diagram) is equal to A067742(15) = 2, equaling the number of central subparts in the SRS(15).
The number of simple-staircases is equal to A281009(15) = 2, equaling the total number of equidistant subparts in the SRS(15).
The total number of staircases is qual to A001227(15) = 4, equaling the number of subparts in the SRS(15).
The number of columns in the diagram is equal to 2*15 - 1 = 29 equaling the number of "widths" in the SRS(15) (cf. A249351).
The number of steps in the successive parts of the diagram are [8, 8, 8], the same as the 15th row of triangle A237270, matching the successive parts in the SRS(15).
The number of steps in the successive staircases from left to right are respectively [8, 7, 1, 8], the same as the 15th row of triangle A280851, matching the successive subparts in the SRS(15).
a(15) = 107 is also the number of cubic cells in the three-dimensional version of the structure whose base is the SRS(15).
The number of polycubes in the structure is equal to A237271(15) = 3, equaling the number of parts in the SRS(15).
The top view of the 3D-Ziggurat of order 15 and the symmetric representation of sigma(15) with subparts look like this:
                                _                                     _
                               |_|                                   | |
                               |_|                                   | |
                               |_|                                   | |
                               |_|                                   | |
                               |_|                                   | |
                               |_|                                   | |
                               |_|                                   | |
                          _ _ _|_|                              _ _ _|_|
                      _ _|_|      36                        _ _| |      8
                     |_|_|_|                               |  _ _|
                    _|_|_|                                _| |_|
                   |_|_|  1                              |_ _|  1
                   |    34                               |    7
    _ _ _ _ _ _ _ _|                      _ _ _ _ _ _ _ _|
   |_|_|_|_|_|_|_|_|                     |_ _ _ _ _ _ _ _|
                    36                                    8
.
     Top view of the 3D-Ziggurat.        The symmetric representation of
     The ziggurat is formed by 3        of sigma(15) is formed by 3 parts.
   polycubes with a(15) = 107 cubes     It has 4 subparts with 24 cells in
   in total. It has 4 staircases       total. It is the base of the ziggurat.
       with 24 steps in total.
.

Links

Crossrefs

Row sums of A347367 and of A347263.
Cf. A356351 (partial sums).
Cf. A279387 (definition of subpart).
Cf. A000079, A000203, A000217, A000290, A000326, A000396, A001227, A002378, A065091, A067742, A131576, A196020, A235791, A236104, A237270, A237271, A237591, A237593, A245092, A246955, A249351, A262626, A280850, A280851, A281009, A296508, A296512, A296513, A335616, A338721, A347273, A347361, A347529, A351819.

Formula

a(2^(n-1)) = n^2 = A000290(n).
a(P) = 1 + P^2, if P is an even perfect number.
a(p) = 2*A000217((p+1)/2) = A002378((p+1)/2), if p is an odd prime.
a(k) = 2*A000217(A000203(k)/2), if k is a member of A246955.

A365434 Irregular triangle read by rows: T(n,k) is the number of cubes in the k-th level of the ziggurat of order n described in A347186, n >= 1, k >= 1.

Original entry on oeis.org

1, 3, 1, 4, 2, 7, 5, 3, 1, 6, 4, 2, 12, 9, 7, 5, 3, 1, 8, 6, 4, 2, 15, 13, 11, 9, 7, 5, 3, 1, 13, 9, 7, 5, 2, 18, 16, 14, 12, 10, 8, 6, 4, 2, 12, 10, 8, 6, 4, 2, 28, 24, 22, 20, 16, 14, 12, 9, 7, 5, 3, 1, 14, 12, 10, 8, 6, 4, 2, 24, 22, 20, 18, 16, 14, 12, 10, 8, 6, 4, 2, 24, 19, 17, 15, 11, 9, 7, 3, 1, 1
Offset: 1

Views

Author

Omar E. Pol, Oct 19 2023

Keywords

Comments

The values of n when the number of terms in row n is equal to n give A174973.
The values of n when the number of terms in row n is not equal to n give A238524.
If and only if n is a power of 2 then row n lists the first n odd numbers in decreasing order.
If and only if n is an odd prime then row n lists the first (n + 1)/2 positive even numbers in decreasing order.
If and only if n is an even perfect number then row n lists 2*n together with the first n - 1 odd numbers in decreasing order.

Examples

			Triangle begins:
   1;
   3,  1;
   4,  2;
   7,  5,  3,  1;
   6,  4,  2;
  12,  9,  7,  5,  3,  1;
   8,  6,  4,  2;
  15, 13, 11,  9,  7,  5,  3,  1;
  13,  9,  7,  5,  2;
  18, 16, 14, 12, 10,  8,  6,  4,  2;
  12, 10,  8,  6,  4,  2;
  28, 24, 22, 20, 16, 14, 12,  9,  7,  5,  3, 1;
  14, 12, 10,  8,  6,  4,  2;
  24, 22, 20, 18, 16, 14, 12, 10,  8,  6,  4, 2;
  24, 19, 17, 15, 11,  9,  7,  3,  1,  1;
  31, 29, 27, 25, 23, 21, 19, 17, 15, 13, 11, 9, 7, 5, 3, 1;
  ...

Crossrefs

Column 1 gives A000203.
Row sums give A347186.
Row lengths give A365433.
Cf. A000079, A000396, A065091, A174973, A196020, A235791, A236104, A237270, A237271, A237591, A237593, A238524, A245092, A262626, A347263, A347367, A365195.

A365195 Height of the first staircase of the ziggurat of order n described in A347186.

Original entry on oeis.org

1, 2, 2, 4, 3, 6, 4, 8, 5, 9, 6, 12, 7, 12, 8, 16, 9, 18, 10, 20, 11, 18, 12, 24, 13, 21, 14, 28, 15, 30, 16, 32, 17, 27, 18, 36, 19, 30, 20, 40, 21, 42, 22, 42, 23, 36, 24, 48, 25, 39, 26, 49, 27, 54, 28, 56, 29, 45, 30, 60, 31, 48, 32, 64, 33, 66, 34, 63, 35, 54, 36, 72, 37, 57, 38, 70, 39, 77, 40, 80
Offset: 1

Views

Author

Omar E. Pol, Aug 25 2023

Keywords

Comments

a(n) is also the number of square cells in the first layer of the symmetric representation of sigma(n) from the border to, at most, the axis of symmetry of the diagram.
The values of a(n) where a(n) = n give A174973.
Since this is a supersequence of A174973 so all powers of 2 and all even perfect numbers are in the sequence.
From Omar E. Pol, Oct 22 2023: (Start)
The values of a(n) where a(n) is not equal to n give A238524.
If n is an odd prime then a(n) = (n + 1)/2.
Shares infinitely many terms with A365433 from which first differs at a(15). (End)

Crossrefs

Cf. A000079, A000396, A065091, A174973, A196020, A235791, A236104, A237270, A237271, A237591, A237593, A238524, A262626, A279387, A347186, A347367, A365433, A365434.

Formula

a(n) <= n.
a(2*n-1) = n.

Extensions

More terms from Omar E. Pol, Oct 22 2023

A365433 Height of the ziggurat of order n described in A347186.

Original entry on oeis.org

1, 2, 2, 4, 3, 6, 4, 8, 5, 9, 6, 12, 7, 12, 10, 16, 9, 18, 10, 20, 13, 18, 12, 24, 13, 21, 16, 28, 15, 30, 16, 32, 19, 27, 21, 36, 19, 30, 22, 40, 21, 42, 22, 42, 40, 36, 24, 48, 25, 39, 28, 49, 27, 54, 36, 56, 31, 45, 30, 60, 31, 48, 36, 64, 41, 66, 34, 63, 37, 56, 36, 72, 37, 57, 61, 70, 50, 77, 40, 80
Offset: 1

Views

Author

Omar E. Pol, Oct 18 2023

Keywords

Comments

The values of a(n) where a(n) = n give A174973.
The values of a(n) where a(n) is not equal to n give A238524.
If n is an odd prime then a(n) = (n + 1)/2.
Since this is a supersequence of A174973 so all powers of 2 and all even perfect numbers are in the sequence.
Shares infinitely many terms with A365195 from which first differs at a(15).

Crossrefs

Row lengths of A365434.
Cf. A000079, A000396, A065091, A174973, A196020, A235791, A236104, A237270, A237271, A237591, A237593, A238524, A245092, A262626, A347186, A347263, A347367, A365195.

Formula

a(2*n-1) >= n.

A356351 Partial sums of the ziggurat sequence A347186.

Original entry on oeis.org

1, 5, 11, 27, 39, 76, 96, 160, 196, 286, 328, 489, 545, 701, 808, 1064, 1154, 1488, 1598, 2006, 2208, 2550, 2706, 3403, 3610, 4072, 4384, 5169, 5409, 6385, 6657, 7681, 8127, 8883, 9324, 10910, 11290, 12220, 12824, 14560, 15022, 16863, 17369, 19175, 20276, 21608, 22208, 25129, 25849, 27669
Offset: 1

Views

Author

Omar E. Pol, Oct 15 2022

Keywords

Comments

a(n) is the volume (or the number of cubes) in a polycube whose base is the symmetric representation of A024916(n) which is formed with the first n 3D-Ziggurats described in A347186.
a(n) is also the total number of cubes in a three-dimensional spiral formed with the first n 3D-Ziggurats described in A347186 (see example). The base of the 3D-spiral is the spiral formed with the symmetric representation of sigma of the first n positive integers as shown in the example section of A239660.

Examples

			For n = 16 the figure shows the top view of a three-dimensional spiral formed with the first 16 3D-Ziggurats described in A347186. There are four 3D-Ziggurats in every quadrant:
.
                  _ _ _ _ _ _ _ _
                 |_|_|_|_|_|_|_|_|_ _ _ _ _ _ _
                 |_|             |_|_|_|_|_|_|_|
                _|_|                           |
               |_|_|  _ _ _ _ _ _              |_ _
            _ _|     |_|_|_|_|_|_|_ _ _ _ _        |_
      _ _ _|_|      _|_|         |_|_|_|_|_|         |
     |_|_|_|_|    _|_|_|                   |_ _      |_ _ _
     |_|      _ _|_|      _ _ _ _          |_|_|         |_|
     |_|     |_|_|_|    _|_|_|_|_|_ _ _      |_|_ _      |_|
     |_|     |_|      _|_|_|     |_|_|_|         |_|     |_|
     |_|     |_|     |_|_|_|           |_ _      |_|     |_|
     |_|     |_|     |_|      _ _        |_|     |_|     |_|
     |_|     |_|     |_|     |_|_|_      |_|     |_|     |_|
    _|_|    _|_|    _|_|    _|_| |_|    _|_|    _|_|    _|_|    _
   |_|     |_|     |_|     |_|         |_|     |_|     |_|     |_|
   |_|     |_|     |_|     |_|_ _     _|_|     |_|     |_|     |_|
   |_|     |_|     |_|       |_|_|_ _|_|_|     |_|     |_|     |_|
   |_|     |_|     |_|_          |_|_|_|    _ _|_|     |_|     |_|
   |_|     |_|         |_                 _|_|_|_|     |_|     |_|
   |_|     |_|_ _        |_ _ _ _        |_|_|    _ _ _|_|     |_|
   |_|           |_      |_|_|_|_|_ _ _ _|_|    _|_|_|_|_|     |_|
   |_|_ _ _        |_            |_|_|_|_|_|  _|_|_|_|    _ _ _|_|
         |_|_ _      |                       |_|_|_|_|   |_|_|_|_|
         |_|_|_|     |_ _ _ _ _ _            |_|_|_|    _|_|
           |_|_|_    |_|_|_|_|_|_|_ _ _ _ _ _|_|      _|_|_|
             |_|_|               |_|_|_|_|_|_|_|  _ _|_|_|
                 |                               |_|_|_|
                 |_ _ _ _ _ _ _ _                |_|
                 |_|_|_|_|_|_|_|_|_ _ _ _ _ _ _ _|_|
                                 |_|_|_|_|_|_|_|_|_|
.
The number of square cells in the top view of the n-th 3D-Ziggurat equals A000203(n).
The total number of square cells in the top view of the 3D-Spiral with the first n 3D-Ziggurats equals A024916(n).
In the above figure the total number of square cells equals A024916(16) = 220.
a(16) = 1064 is the total number of cubes in the 3D-Spiral with the first 16 3D-Ziggurats.

Crossrefs

Cf. A000203, A024916, A196020, A235791, A236104, A237270, A237591, A237593, A239660, A239931, A239932, A239933, A239934, A347186, A296508, A299778, A347186, A347263, A347367, A347529, A351819.
Showing 1-5 of 5 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.