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

A237590 a(n) is the total number of regions (or parts) after n-th stage in the diagram of the symmetries of sigma described in A236104.

Original entry on oeis.org

1, 2, 4, 5, 7, 8, 10, 11, 14, 16, 18, 19, 21, 23, 26, 27, 29, 30, 32, 33, 37, 39, 41, 42, 45, 47, 51, 52, 54, 55, 57, 58, 62, 64, 67, 68, 70, 72, 76, 77, 79, 80, 82, 84, 87, 89, 91, 92, 95, 98, 102, 104, 106, 107, 111, 112, 116, 118, 120, 121, 123, 125, 130, 131, 135, 136, 138, 140, 144, 147, 149, 150, 152, 154
Offset: 1

Views

Author

Omar E. Pol, Mar 31 2014

Keywords

Comments

The total area (or total number of cells) of the diagram after n stages is equal to A024916(n), the sum of all divisors of all positive integers <= n.
Note that the region between the virtual circumscribed square and the diagram is a symmetric polygon whose area is equal to A004125(n), see example.
For more information see A237593 and A237270.
a(n) is also the total number of terraces of the stepped pyramid with n levels described in A245092. - Omar E. Pol, Apr 20 2016

Examples

			Illustration of initial terms:
.                                                         _ _ _ _
.                                           _ _ _        |_ _ _  |_
.                               _ _ _      |_ _ _|       |_ _ _|   |_
.                     _ _      |_ _  |_    |_ _  |_ _    |_ _  |_ _  |
.             _ _    |_ _|_    |_ _|_  |   |_ _|_  | |   |_ _|_  | | |
.       _    |_  |   |_  | |   |_  | | |   |_  | | | |   |_  | | | | |
.      |_|   |_|_|   |_|_|_|   |_|_|_|_|   |_|_|_|_|_|   |_|_|_|_|_|_|
.
.
.       1      2        4          5            7              8
.
For n = 6 the diagram contains 8 regions (or parts), so a(6) = 8.
The sum of all divisors of all positive integers <= 6 is [1] + [1+2] + [1+3] + [1+2+4] + [1+5] + [1+2+3+6] = 33. On the other hand after 6 stages the sum of all parts of the diagram is [1] + [3] + [2+2] + [7] + [3+3] + [12] = 33, equaling the sum of all divisors of all positive integers <= 6.
Note that the region between the virtual circumscribed square and the diagram is a symmetric polygon whose area is equal to A004125(6) = 3.
From _Omar E. Pol_, Dec 25 2020: (Start)
Illustration of the diagram after 29 stages (contain 215 vertices, 268 edges and 54 regions or parts):
._ _ _ _ _ _ _ _ _ _ _ _ _ _ _
|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
|_ _ _ _ _ _ _ _ _ _ _ _ _ _  |
|_ _ _ _ _ _ _ _ _ _ _ _ _ _| |
|_ _ _ _ _ _ _ _ _ _ _ _ _  | |
|_ _ _ _ _ _ _ _ _ _ _ _ _| | |
|_ _ _ _ _ _ _ _ _ _ _ _  | | |_ _ _
|_ _ _ _ _ _ _ _ _ _ _ _| | |_ _ _  |
|_ _ _ _ _ _ _ _ _ _ _  | | |_ _  | |_
|_ _ _ _ _ _ _ _ _ _ _| | |_ _ _| |_  |_
|_ _ _ _ _ _ _ _ _ _  | |       |_ _|   |_
|_ _ _ _ _ _ _ _ _ _| | |_ _    |_  |_ _  |_ _
|_ _ _ _ _ _ _ _ _  | |_ _ _|     |_  | |_ _  |
|_ _ _ _ _ _ _ _ _| | |_ _  |_      |_|_ _  | |
|_ _ _ _ _ _ _ _  | |_ _  |_ _|_        | | | |_ _ _ _ _ _
|_ _ _ _ _ _ _ _| |     |     | |_ _    | |_|_ _ _ _ _  | |
|_ _ _ _ _ _ _  | |_ _  |_    |_  | |   |_ _ _ _ _  | | | |
|_ _ _ _ _ _ _| |_ _  |_  |_ _  | | |_ _ _ _ _  | | | | | |
|_ _ _ _ _ _  | |_  |_  |_    | |_|_ _ _ _  | | | | | | | |
|_ _ _ _ _ _| |_ _|   |_  |   |_ _ _ _  | | | | | | | | | |
|_ _ _ _ _  |     |_ _  | |_ _ _ _  | | | | | | | | | | | |
|_ _ _ _ _| |_      | |_|_ _ _  | | | | | | | | | | | | | |
|_ _ _ _  |_ _|_    |_ _ _  | | | | | | | | | | | | | | | |
|_ _ _ _| |_  | |_ _ _  | | | | | | | | | | | | | | | | | |
|_ _ _  |_  |_|_ _  | | | | | | | | | | | | | | | | | | | |
|_ _ _|   |_ _  | | | | | | | | | | | | | | | | | | | | | |
|_ _  |_ _  | | | | | | | | | | | | | | | | | | | | | | | |
|_ _|_  | | | | | | | | | | | | | | | | | | | | | | | | | |
|_  | | | | | | | | | | | | | | | | | | | | | | | | | | | |
|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|
.
(End)
		

Crossrefs

Partial sums of A237271.
Compare with A060831 (analog for the diagram that contains subparts).

Programs

  • Mathematica
    (* total number of parts in the first n symmetric representations *)
    (* Function a237270[] is defined in A237270 *)
    (* variable "previous" represents the sum from 1 through m-1 *)
    a237590[previous_,{m_,n_}]:=Rest[FoldList[Plus[#1,Length[a237270[#2]]]&,previous,Range[m,n]]]
    a237590[n_]:=a237590[0,{1,n}]
    a237590[78] (* data *)
    (* Hartmut F. W. Hoft, Jul 07 2014 *)

Formula

a(n) = A317109(n) - A294723(n) + 1 (Euler's formula). - Omar E. Pol, Jul 21 2018

Extensions

Definition clarified by Omar E. Pol, Jul 21 2018

A294723 a(n) is the total number of vertices after n-th stage in the diagram of the symmetries of sigma described in A236104, with a(0) = 1.

Original entry on oeis.org

1, 4, 7, 11, 16, 20, 27, 31, 38, 45, 53, 57, 66, 70, 78, 89, 100, 104, 115, 119, 130, 142, 150, 154, 167, 176, 184, 196, 211, 215, 230, 234, 249, 261, 269, 280, 297, 301, 309, 321, 338, 342, 359, 363, 379, 398, 406, 410, 429, 440, 459, 471, 487, 491, 510
Offset: 0

Views

Author

Omar E. Pol, Nov 07 2017

Keywords

Comments

a(n) is also the total number of "hinges" in the "mechanism" where every row of the two-dimensional diagram of the isosceles triangle with n rows described in A237593 is folded in a 90-degree zig-zag, appearing the structure of the stepped pyramid with n levels described in A245092. Note that the diagram described in A236104 is also the top view of the mentioned pyramid. The area of the terraces in the n-th level of the pyramid, starting from the top, equals sigma(n) = A000203(n).
For the construction of the two-dimensional diagram using Dyck paths and for more information about the pyramid see A237593 and A262626.
Note that every line segment of the Dyck paths of the diagram is related to partitions into consecutive parts (see A237591). - Omar E. Pol, Feb 23 2018

Examples

			Illustration of initial terms (n = 0..9):
.                                                           _ _ _ _
.                                             _ _ _        |_ _ _  |_
.                                 _ _ _      |_ _ _|       |_ _ _|   |_
.                       _ _      |_ _  |_    |_ _  |_ _    |_ _  |_ _  |
.               _ _    |_ _|_    |_ _|_  |   |_ _|_  | |   |_ _|_  | | |
.         _    |_  |   |_  | |   |_  | | |   |_  | | | |   |_  | | | | |
.    .   |_|   |_|_|   |_|_|_|   |_|_|_|_|   |_|_|_|_|_|   |_|_|_|_|_|_|
.
.    1    4      7        11         16           20             27
.
.
.                                               _ _ _ _ _
.                         _ _ _ _ _            |_ _ _ _ _|
.     _ _ _ _            |_ _ _ _  |           |_ _ _ _  |_ _
.    |_ _ _ _|           |_ _ _ _| |_          |_ _ _ _| |_  |
.    |_ _ _  |_          |_ _ _  |_  |_ _      |_ _ _  |_  |_|_ _
.    |_ _ _|   |_ _      |_ _ _|   |_ _  |     |_ _ _|   |_ _  | |
.    |_ _  |_ _  | |     |_ _  |_ _  | | |     |_ _  |_ _  | | | |
.    |_ _|_  | | | |     |_ _|_  | | | | |     |_ _|_  | | | | | |
.    |_  | | | | | |     |_  | | | | | | |     |_  | | | | | | | |
.    |_|_|_|_|_|_|_|     |_|_|_|_|_|_|_|_|     |_|_|_|_|_|_|_|_|_|
.
.           31                  38                     45
.
.
Illustration of the diagram after 29 stages (contain 215 vertices, 268 edges and 54 regions or parts):
._ _ _ _ _ _ _ _ _ _ _ _ _ _ _
|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
|_ _ _ _ _ _ _ _ _ _ _ _ _ _  |
|_ _ _ _ _ _ _ _ _ _ _ _ _ _| |
|_ _ _ _ _ _ _ _ _ _ _ _ _  | |
|_ _ _ _ _ _ _ _ _ _ _ _ _| | |
|_ _ _ _ _ _ _ _ _ _ _ _  | | |_ _ _
|_ _ _ _ _ _ _ _ _ _ _ _| | |_ _ _  |
|_ _ _ _ _ _ _ _ _ _ _  | | |_ _  | |_
|_ _ _ _ _ _ _ _ _ _ _| | |_ _ _| |_  |_
|_ _ _ _ _ _ _ _ _ _  | |       |_ _|   |_
|_ _ _ _ _ _ _ _ _ _| | |_ _    |_  |_ _  |_ _
|_ _ _ _ _ _ _ _ _  | |_ _ _|     |_  | |_ _  |
|_ _ _ _ _ _ _ _ _| | |_ _  |_      |_|_ _  | |
|_ _ _ _ _ _ _ _  | |_ _  |_ _|_        | | | |_ _ _ _ _ _
|_ _ _ _ _ _ _ _| |     |     | |_ _    | |_|_ _ _ _ _  | |
|_ _ _ _ _ _ _  | |_ _  |_    |_  | |   |_ _ _ _ _  | | | |
|_ _ _ _ _ _ _| |_ _  |_  |_ _  | | |_ _ _ _ _  | | | | | |
|_ _ _ _ _ _  | |_  |_  |_    | |_|_ _ _ _  | | | | | | | |
|_ _ _ _ _ _| |_ _|   |_  |   |_ _ _ _  | | | | | | | | | |
|_ _ _ _ _  |     |_ _  | |_ _ _ _  | | | | | | | | | | | |
|_ _ _ _ _| |_      | |_|_ _ _  | | | | | | | | | | | | | |
|_ _ _ _  |_ _|_    |_ _ _  | | | | | | | | | | | | | | | |
|_ _ _ _| |_  | |_ _ _  | | | | | | | | | | | | | | | | | |
|_ _ _  |_  |_|_ _  | | | | | | | | | | | | | | | | | | | |
|_ _ _|   |_ _  | | | | | | | | | | | | | | | | | | | | | |
|_ _  |_ _  | | | | | | | | | | | | | | | | | | | | | | | |
|_ _|_  | | | | | | | | | | | | | | | | | | | | | | | | | |
|_  | | | | | | | | | | | | | | | | | | | | | | | | | | | |
|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|
.
		

Crossrefs

Cf. A317109 (number of edges).
Cf. A237590 (number of regions or parts).
Compare with A317293 (analog for the diagram that contains subparts).

Formula

a(n) = A317109(n) - A237590(n) + 1 (Euler's formula). - Omar E. Pol, Jul 21 2018

Extensions

Terms a(30) and beyond from Robert Price, Jul 31 2018
Example extended for a(7)-a(9) and a(29) by Omar E. Pol, Jul 31 2018

A340846 a(n) is the number of edges in the diagram of the symmetric representation of sigma(n).

Original entry on oeis.org

4, 6, 8, 10, 10, 12, 12, 14, 16, 16, 14, 18, 14, 18, 22, 22, 16, 22, 16, 22, 26, 22, 18, 26, 24, 22, 28, 28, 20, 30, 20, 30, 30, 24, 28, 32, 22, 26, 32, 34, 22, 34, 22, 34, 38, 28, 24, 38, 32, 40, 34, 36, 24, 38, 38, 42, 36, 30, 26, 42, 26, 30, 46, 42, 40, 44, 28
Offset: 1

Views

Author

Omar E. Pol, Jan 24 2021

Keywords

Comments

Since the diagram is symmetric so all terms are even numbers.
For another version with subparts see A340848 from which first differs at a(6).

Examples

			Illustration of initial terms:
.                                                          _ _ _ _
.                                            _ _ _        |_ _ _  |_
.                                _ _ _      |_ _ _|             |   |_
.                      _ _      |_ _  |_          |_ _          |_ _  |
.              _ _    |_ _|_        |_  |           | |             | |
.        _    |_  |       | |         | |           | |             | |
.       |_|     |_|       |_|         |_|           |_|             |_|
.
n:       1      2        3          4           5               6
a(n):    4      6        8         10          10              12
.
For n = 6 the diagram has 12 edges so a(6) = 12.
On the other hand the diagram has 12 vertices and only one part or region, so applying Euler's formula we have that a(6) = 12 + 1 - 1 = 12.
.                                                  _ _ _ _ _
.                            _ _ _ _ _            |_ _ _ _ _|
.        _ _ _ _            |_ _ _ _  |                     |_ _
.       |_ _ _ _|                   | |_                    |_  |
.               |_                  |_  |_ _                  |_|_ _
.                 |_ _                |_ _  |                     | |
.                   | |                   | |                     | |
.                   | |                   | |                     | |
.                   | |                   | |                     | |
.                   |_|                   |_|                     |_|
.
n:              7                    8                      9
a(n):          12                   14                     16
.
For n = 9 the diagram has 16 edges so a(9) = 16.
On the other hand the diagram has 14 vertices and three parts or regions, so applying Euler's formula we have that a(9) = 14 + 3 - 1 = 16.
Another way for the illustration of initial terms is as follows:
--------------------------------------------------------------------------
.  n  a(n)                             Diagram
--------------------------------------------------------------------------
            _
   1   4   |_|  _
              _| |  _
   2   6     |_ _| | |  _
                _ _|_| | |  _
   3   8       |_ _|  _| | | |  _
                  _ _|  _| | | | |  _
   4  10         |_ _ _|  _|_| | | | |  _
                    _ _ _|  _ _| | | | | |  _
   5  10           |_ _ _| |    _| | | | | | |  _
                      _ _ _|  _|  _|_| | | | | | |  _
   6  12             |_ _ _ _|  _|  _ _| | | | | | | |  _
                        _ _ _ _|  _|  _ _| | | | | | | | |  _
   7  12               |_ _ _ _| |  _|  _ _|_| | | | | | | | |  _
                          _ _ _ _| |  _| |  _ _| | | | | | | | | |  _
   8  14                 |_ _ _ _ _| |_ _| |  _ _| | | | | | | | | | |  _
                            _ _ _ _ _|  _ _|_|  _ _|_| | | | | | | | | | |
   9  16                   |_ _ _ _ _| |  _|  _|  _ _ _| | | | | | | | | |
                              _ _ _ _ _| |  _|  _|    _ _| | | | | | | | |
  10  16                     |_ _ _ _ _ _| |  _|     |  _ _|_| | | | | | |
                                _ _ _ _ _ _| |      _| |  _ _ _| | | | | |
  11  14                       |_ _ _ _ _ _| |  _ _|  _| |  _ _ _| | | | |
                                  _ _ _ _ _ _| |  _ _|  _|_|  _ _ _|_| | |
  12  18                         |_ _ _ _ _ _ _| |  _ _|  _ _| |  _ _ _| |
                                    _ _ _ _ _ _ _| |  _| |    _| |  _ _ _|
  13  14                           |_ _ _ _ _ _ _| | |  _|  _|  _| |
                                      _ _ _ _ _ _ _| | |_ _|  _|  _|
  14  18                             |_ _ _ _ _ _ _ _| |  _ _|  _|
                                        _ _ _ _ _ _ _ _| |  _ _|
  15  22                               |_ _ _ _ _ _ _ _| | |
                                          _ _ _ _ _ _ _ _| |
  16  22                                 |_ _ _ _ _ _ _ _ _|
...
		

Crossrefs

Cf. A237271 (number of parts or regions).
Cf. A340833 (number of vertices).
Cf. A340848 (number of edges in the diagram with subparts).
Cf. A317109 (total number of edges in the unified diagram).
Cf. A239931-A239934 (illustration of first 32 diagrams).

Formula

a(n) = A340833(n) + A237271(n) - 1 (Euler's formula).

Extensions

More terms from Omar E. Pol, Oct 28 2021

A317292 a(n) is the total number of edges after n-th stage in the diagram of the symmetries of sigma in which the parts of width > 1 are dissected into subparts of width 1, with a(0) = 0.

Original entry on oeis.org

0, 4, 8, 14, 20, 26, 36, 42, 50, 60, 70, 76, 92, 98, 108, 124, 136, 142, 160, 166, 182, 198, 208, 214, 238, 250, 260, 276, 294, 300
Offset: 0

Views

Author

Omar E. Pol, Jul 27 2018

Keywords

Comments

All terms are even numbers.
Note that in the diagram the number of regions or subparts equals A060831, the partial sums of A001227, n >= 1.

Examples

			Illustration of initial terms (n = 1..9):
.                                                       _ _ _ _
.                                         _ _ _        |_ _ _  |_
.                             _ _ _      |_ _ _|       |_ _ _| |_|_
.                   _ _      |_ _  |_    |_ _  |_ _    |_ _  |_ _  |
.           _ _    |_ _|_    |_ _|_  |   |_ _|_  | |   |_ _|_  | | |
.     _    |_  |   |_  | |   |_  | | |   |_  | | | |   |_  | | | | |
.    |_|   |_|_|   |_|_|_|   |_|_|_|_|   |_|_|_|_|_|   |_|_|_|_|_|_|
.
.     4      8        14         20           26             36
.
.                                               _ _ _ _ _
.                         _ _ _ _ _            |_ _ _ _ _|
.     _ _ _ _            |_ _ _ _  |           |_ _ _ _  |_ _
.    |_ _ _ _|           |_ _ _ _| |_          |_ _ _ _| |_  |
.    |_ _ _  |_          |_ _ _  |_  |_ _      |_ _ _  |_  |_|_ _
.    |_ _ _| |_|_ _      |_ _ _| |_|_ _  |     |_ _ _| |_|_ _  | |
.    |_ _  |_ _  | |     |_ _  |_ _  | | |     |_ _  |_ _  | | | |
.    |_ _|_  | | | |     |_ _|_  | | | | |     |_ _|_  | | | | | |
.    |_  | | | | | |     |_  | | | | | | |     |_  | | | | | | | |
.    |_|_|_|_|_|_|_|     |_|_|_|_|_|_|_|_|     |_|_|_|_|_|_|_|_|_|
.
.           42                  50                     60
.
.
Illustration of the two-dimensional diagram after 29 stages (contains 300 edges, 239 vertices and 62 regions or subparts):
._ _ _ _ _ _ _ _ _ _ _ _ _ _ _
|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
|_ _ _ _ _ _ _ _ _ _ _ _ _ _  |
|_ _ _ _ _ _ _ _ _ _ _ _ _ _| |
|_ _ _ _ _ _ _ _ _ _ _ _ _  | |
|_ _ _ _ _ _ _ _ _ _ _ _ _| | |
|_ _ _ _ _ _ _ _ _ _ _ _  | | |_ _ _
|_ _ _ _ _ _ _ _ _ _ _ _| | |_ _ _  |
|_ _ _ _ _ _ _ _ _ _ _  | | |_ _  | |_
|_ _ _ _ _ _ _ _ _ _ _| | |_ _ _| |_  |_
|_ _ _ _ _ _ _ _ _ _  | | |_ _  |_ _| |_|_
|_ _ _ _ _ _ _ _ _ _| | |_ _  | |_  |_ _  |_ _
|_ _ _ _ _ _ _ _ _  | |_ _ _| |_  |_  | |_ _  |
|_ _ _ _ _ _ _ _ _| | |_ _  |_  |_  |_|_ _  | |
|_ _ _ _ _ _ _ _  | |_ _  |_ _|_  |_ _  | | | |_ _ _ _ _ _
|_ _ _ _ _ _ _ _| | |_ _| |_  | |_ _  | | |_|_ _ _ _ _  | |
|_ _ _ _ _ _ _  | |_ _  |_  |_|_  | | |_|_ _ _ _ _  | | | |
|_ _ _ _ _ _ _| |_ _  |_  |_ _  | | |_ _ _ _ _  | | | | | |
|_ _ _ _ _ _  | |_  |_  |_  | | |_|_ _ _ _  | | | | | | | |
|_ _ _ _ _ _| |_ _| |_|_  | |_|_ _ _ _  | | | | | | | | | |
|_ _ _ _ _  | |_  |_ _  | |_ _ _ _  | | | | | | | | | | | |
|_ _ _ _ _| |_  |_  | |_|_ _ _  | | | | | | | | | | | | | |
|_ _ _ _  |_ _|_  |_|_ _ _  | | | | | | | | | | | | | | | |
|_ _ _ _| |_  | |_ _ _  | | | | | | | | | | | | | | | | | |
|_ _ _  |_  |_|_ _  | | | | | | | | | | | | | | | | | | | |
|_ _ _| |_|_ _  | | | | | | | | | | | | | | | | | | | | | |
|_ _  |_ _  | | | | | | | | | | | | | | | | | | | | | | | |
|_ _|_  | | | | | | | | | | | | | | | | | | | | | | | | | |
|_  | | | | | | | | | | | | | | | | | | | | | | | | | | | |
|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|
.
		

Crossrefs

For the definition of "subparts" see A279387.
For the triangle of sums of subparts see A279388.
Cf. A317293 (number of vertices).
Cf. A060831 (number of regions or subparts).
Compare with A317109 (analog for the diagram that contains only parts).
First differs from A317109 at a(6).

Formula

a(n) = A317293(n) + A060831(n) - 1 (Euler's formula).

A317293 a(n) is the total number of vertices after n-th stage in the diagram of the symmetries of sigma in which the parts of width > 1 are dissected into subparts of width 1, with a(0) = 1.

Original entry on oeis.org

1, 4, 7, 11, 16, 20, 28, 32, 39, 46, 54, 58, 72, 76, 84, 96, 107, 111, 126, 130, 144, 156, 164, 168, 190, 199, 207, 219, 235, 239
Offset: 0

Views

Author

Omar E. Pol, Jul 27 2018

Keywords

Comments

Note that in the diagram the number of regions or subparts equals A060831, the partial sums of A001227, n >= 1.

Examples

			Illustration of initial terms (n = 0..9):
.                                                           _ _ _ _
.                                             _ _ _        |_ _ _  |_
.                                 _ _ _      |_ _ _|       |_ _ _| |_|_
.                       _ _      |_ _  |_    |_ _  |_ _    |_ _  |_ _  |
.               _ _    |_ _|_    |_ _|_  |   |_ _|_  | |   |_ _|_  | | |
.         _    |_  |   |_  | |   |_  | | |   |_  | | | |   |_  | | | | |
.    .   |_|   |_|_|   |_|_|_|   |_|_|_|_|   |_|_|_|_|_|   |_|_|_|_|_|_|
.
.    1    4      7        11         16           20             28
.
.                                               _ _ _ _ _
.                         _ _ _ _ _            |_ _ _ _ _|
.     _ _ _ _            |_ _ _ _  |           |_ _ _ _  |_ _
.    |_ _ _ _|           |_ _ _ _| |_          |_ _ _ _| |_  |
.    |_ _ _  |_          |_ _ _  |_  |_ _      |_ _ _  |_  |_|_ _
.    |_ _ _| |_|_ _      |_ _ _| |_|_ _  |     |_ _ _| |_|_ _  | |
.    |_ _  |_ _  | |     |_ _  |_ _  | | |     |_ _  |_ _  | | | |
.    |_ _|_  | | | |     |_ _|_  | | | | |     |_ _|_  | | | | | |
.    |_  | | | | | |     |_  | | | | | | |     |_  | | | | | | | |
.    |_|_|_|_|_|_|_|     |_|_|_|_|_|_|_|_|     |_|_|_|_|_|_|_|_|_|
.
.           32                  39                     46
.
.
Illustration of the two-dimensional diagram after 29 stages (contains 239 vertices, 300 edges and 62 regions or subparts):
._ _ _ _ _ _ _ _ _ _ _ _ _ _ _
|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
|_ _ _ _ _ _ _ _ _ _ _ _ _ _  |
|_ _ _ _ _ _ _ _ _ _ _ _ _  | |
|_ _ _ _ _ _ _ _ _ _ _ _ _| | |
|_ _ _ _ _ _ _ _ _ _ _ _  | | |_ _ _
|_ _ _ _ _ _ _ _ _ _ _ _| | |_ _ _  |
|_ _ _ _ _ _ _ _ _ _ _  | | |_ _  | |_
|_ _ _ _ _ _ _ _ _ _ _| | |_ _ _| |_  |_
|_ _ _ _ _ _ _ _ _ _  | | |_ _  |_ _| |_|_
|_ _ _ _ _ _ _ _ _ _| | |_ _  | |_  |_ _  |_ _
|_ _ _ _ _ _ _ _ _  | |_ _ _| |_  |_  | |_ _  |
|_ _ _ _ _ _ _ _ _| | |_ _  |_  |_  |_|_ _  | |
|_ _ _ _ _ _ _ _  | |_ _  |_ _|_  |_ _  | | | |_ _ _ _ _ _
|_ _ _ _ _ _ _ _| | |_ _| |_  | |_ _  | | |_|_ _ _ _ _  | |
|_ _ _ _ _ _ _  | |_ _  |_  |_|_  | | |_|_ _ _ _ _  | | | |
|_ _ _ _ _ _ _| |_ _  |_  |_ _  | | |_ _ _ _ _  | | | | | |
|_ _ _ _ _ _  | |_  |_  |_  | | |_|_ _ _ _  | | | | | | | |
|_ _ _ _ _ _| |_ _| |_|_  | |_|_ _ _ _  | | | | | | | | | |
|_ _ _ _ _  | |_  |_ _  | |_ _ _ _  | | | | | | | | | | | |
|_ _ _ _ _| |_  |_  | |_|_ _ _  | | | | | | | | | | | | | |
|_ _ _ _  |_ _|_  |_|_ _ _  | | | | | | | | | | | | | | | |
|_ _ _ _| |_  | |_ _ _  | | | | | | | | | | | | | | | | | |
|_ _ _  |_  |_|_ _  | | | | | | | | | | | | | | | | | | | |
|_ _ _| |_|_ _  | | | | | | | | | | | | | | | | | | | | | |
|_ _  |_ _  | | | | | | | | | | | | | | | | | | | | | | | |
|_ _|_  | | | | | | | | | | | | | | | | | | | | | | | | | |
|_  | | | | | | | | | | | | | | | | | | | | | | | | | | | |
|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|
.
		

Crossrefs

For the definition of "subparts" see A279387.
For the triangle of sums of subparts see A279388.
Cf. A317292 (number of edges).
Cf. A060831 (number of regions or subparts).
Compare with A294723 (analog for the diagram that contains only parts).
First differs from A294723 at a(6).

Formula

a(n) = A317292(n) - A060831(n) + 1 (Euler's formula).

A325301 a(n) is the number of edges of the stepped pyramid with n levels described in A245092.

Original entry on oeis.org

12, 21, 36, 51, 63, 84, 96, 117, 138, 165, 177, 204, 216, 240, 273, 306, 318, 351, 363
Offset: 1

Views

Author

Omar E. Pol, Apr 16 2019

Keywords

Comments

To calculate a(n) consider that levels greater than n do not exist.

Examples

			For n = 1 the first level of the stepped pyramid (starting from the top) is a cube, and a cube has 12 edges, so a(1) = 12.
		

Crossrefs

Cf. A325300 (number of faces), A325302 (number of vertices).

Formula

a(n) = A325300(n) + A325302(n) - 2 (Euler's formula).
Showing 1-6 of 6 results.