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-8 of 8 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)

Links

Crossrefs

Partial sums of A237271.
Compare with A060831 (analog for the diagram that contains subparts).
Cf. A000203, A004125, A024916, A196020, A236104, A235791, A237048, A237270, A237591, A237593, A239659, A239660, A239663, A239665, A239931-A239934, A245092, A244050, A244970, A262626, A317109.

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

A340833 a(n) is the number of vertices in the diagram of the symmetric representation of sigma(n).

Original entry on oeis.org

4, 6, 7, 10, 9, 12, 11, 14, 14, 15, 13, 18, 13, 17, 20, 22, 15, 22, 15, 22, 23, 21, 17, 26, 22, 21, 25, 28, 19, 30, 19, 30, 27, 23, 26, 32, 21, 25, 29, 34, 21, 34, 21, 33, 36, 27, 23, 38, 30, 38, 31, 35, 23, 38, 35, 42, 33, 29, 25, 42, 25, 29, 42, 42, 37, 44, 27
Offset: 1

Views

Author

Omar E. Pol, Jan 23 2021

Keywords

Comments

If A237271(n) is odd then a(n) is even.
If A237271(n) is even then a(n) is odd.
The above sentences arise that the diagram is always symmetric for any value of n hence the number of edges is always an even number. Also from Euler's formula.
Indices of odd terms give A071561.
Indices of even terms give A071562.
For another version with subparts see A340847 from which first differs at a(6).
The parity of this sequence is also the characteristic function of numbers that have no middle divisors (cf. A348327). - Omar E. Pol, Oct 14 2021

Examples

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

Links

Crossrefs

Parity gives A348327.
Cf. A237271 (number of parts or regions).
Cf. A340846 (number of edges).
Cf. A340847 (number of vertices in the diagram with subparts).
Cf. A294723 (total number of vertices in the unified diagram).
Cf. A239931-A239934 (illustration of first 32 diagrams).
Cf. A000203, A071561, A071562, A196020, A236104, A235791, A237048, A237270, A237590, A237591, A237593, A239660, A245092, A262626, A340848.

Programs

  • Mathematica
    MapAt[# + 1 &, #, 1] &@ Map[Length@ Union[Join @@ #] - 1 &, Partition[Prepend[#, {{0, 0}}], 2, 1]] &@ Table[{{0, 0}}~Join~Accumulate[Join[#, Reverse[Reverse /@ (-1*#)]]] &@ MapIndexed[Which[#2 == 1, {#1, 0}, Mod[#2, 2] == 0, {0, #1}, True, {-#1, 0}] & @@ {#1, First[#2]} &, If[Length[#] == 0, {n, n}, Join[{n}, #, {n - Total[#]}]]] &@ Differences[n - Array[(Ceiling[(n + 1)/# - (# + 1)/2]) &, Floor[(Sqrt[8 n + 1] - 1)/2]]], {n, 67}] (* Michael De Vlieger, Oct 27 2021 *)

Formula

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

Extensions

Terms a(33) and beyond from Michael De Vlieger, Oct 27 2021

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

Original entry on oeis.org

0, 4, 8, 14, 20, 26, 34, 40, 48, 58, 68, 74, 84, 90, 100, 114, 126, 132, 144, 150, 162, 178, 188, 194, 208, 220, 230, 246, 262, 268, 284, 290, 306, 322, 332, 346, 364, 370, 380, 396, 414, 420, 438, 444, 462, 484, 494, 500, 520, 534, 556, 572, 590, 596, 616, 636
Offset: 0

Views

Author

Omar E. Pol, Jul 21 2018

Keywords

Comments

All terms are even numbers.
Note that the two-dimensional diagram is also the top view of the stepped pyramid with n levels described in A245092.
For the construction of the two-dimensional diagram using Dyck paths and for more information about the pyramid see A237593.

Examples

			Illustration of initial terms (n = 1..9):
.                                                       _ _ _ _
.                                         _ _ _        |_ _ _  |_
.                             _ _ _      |_ _ _|       |_ _ _|   |_
.                   _ _      |_ _  |_    |_ _  |_ _    |_ _  |_ _  |
.           _ _    |_ _|_    |_ _|_  |   |_ _|_  | |   |_ _|_  | | |
.     _    |_  |   |_  | |   |_  | | |   |_  | | | |   |_  | | | | |
.    |_|   |_|_|   |_|_|_|   |_|_|_|_|   |_|_|_|_|_|   |_|_|_|_|_|_|
.
.     4      8        14         20           26             34
.
.                                               _ _ _ _ _
.                         _ _ _ _ _            |_ _ _ _ _|
.     _ _ _ _            |_ _ _ _  |           |_ _ _ _  |_ _
.    |_ _ _ _|           |_ _ _ _| |_          |_ _ _ _| |_  |
.    |_ _ _  |_          |_ _ _  |_  |_ _      |_ _ _  |_  |_|_ _
.    |_ _ _|   |_ _      |_ _ _|   |_ _  |     |_ _ _|   |_ _  | |
.    |_ _  |_ _  | |     |_ _  |_ _  | | |     |_ _  |_ _  | | | |
.    |_ _|_  | | | |     |_ _|_  | | | | |     |_ _|_  | | | | | |
.    |_  | | | | | |     |_  | | | | | | |     |_  | | | | | | | |
.    |_|_|_|_|_|_|_|     |_|_|_|_|_|_|_|_|     |_|_|_|_|_|_|_|_|_|
.
.           40                  48                     58
.
.
Illustration of the diagram after 29 stages (contain 268 edges, 215 vertices and 54 regions or parts):
._ _ _ _ _ _ _ _ _ _ _ _ _ _ _
|_ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
|_ _ _ _ _ _ _ _ _ _ _ _ _ _  |
|_ _ _ _ _ _ _ _ _ _ _ _ _ _| |
|_ _ _ _ _ _ _ _ _ _ _ _ _  | |
|_ _ _ _ _ _ _ _ _ _ _ _ _| | |
|_ _ _ _ _ _ _ _ _ _ _ _  | | |_ _ _
|_ _ _ _ _ _ _ _ _ _ _ _| | |_ _ _  |
|_ _ _ _ _ _ _ _ _ _ _  | | |_ _  | |_
|_ _ _ _ _ _ _ _ _ _ _| | |_ _ _| |_  |_
|_ _ _ _ _ _ _ _ _ _  | |       |_ _|   |_
|_ _ _ _ _ _ _ _ _ _| | |_ _    |_  |_ _  |_ _
|_ _ _ _ _ _ _ _ _  | |_ _ _|     |_  | |_ _  |
|_ _ _ _ _ _ _ _ _| | |_ _  |_      |_|_ _  | |
|_ _ _ _ _ _ _ _  | |_ _  |_ _|_        | | | |_ _ _ _ _ _
|_ _ _ _ _ _ _ _| |     |     | |_ _    | |_|_ _ _ _ _  | |
|_ _ _ _ _ _ _  | |_ _  |_    |_  | |   |_ _ _ _ _  | | | |
|_ _ _ _ _ _ _| |_ _  |_  |_ _  | | |_ _ _ _ _  | | | | | |
|_ _ _ _ _ _  | |_  |_  |_    | |_|_ _ _ _  | | | | | | | |
|_ _ _ _ _ _| |_ _|   |_  |   |_ _ _ _  | | | | | | | | | |
|_ _ _ _ _  |     |_ _  | |_ _ _ _  | | | | | | | | | | | |
|_ _ _ _ _| |_      | |_|_ _ _  | | | | | | | | | | | | | |
|_ _ _ _  |_ _|_    |_ _ _  | | | | | | | | | | | | | | | |
|_ _ _ _| |_  | |_ _ _  | | | | | | | | | | | | | | | | | |
|_ _ _  |_  |_|_ _  | | | | | | | | | | | | | | | | | | | |
|_ _ _|   |_ _  | | | | | | | | | | | | | | | | | | | | | |
|_ _  |_ _  | | | | | | | | | | | | | | | | | | | | | | | |
|_ _|_  | | | | | | | | | | | | | | | | | | | | | | | | | |
|_  | | | | | | | | | | | | | | | | | | | | | | | | | | | |
|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|
.

Links

Crossrefs

Cf. A294723 (number of vertices).
Cf. A237590 (number of regions or parts).
Compare with A317292 (analog for the diagram that contains subparts).
Cf. A000203, A024916, A196020, A235791, A236104, A237048, A237270, A237271, A237591, A237593, A245092, A262626, A296508.

Formula

a(n) = A294723(n) + A237590(n) - 1 (Euler's formula).

Extensions

More terms and b-file from Robert Price, Jul 31 2018

A294847 a(n) is the total number of line segments in the diagram described in A236104 after n-th stage, with a(0) = 2.

Original entry on oeis.org

2, 4, 6, 8, 12, 14, 20, 22, 28, 32, 38, 40, 48, 50, 56, 64, 74, 76, 86, 88, 98, 106, 112, 114, 126, 132, 138, 146, 160, 162
Offset: 0

Views

Author

Omar E. Pol, Nov 09 2017

Keywords

Comments

Note that the diagram is also the top view of the stepped pyramid with n levels described in A245092.
For the construction of the diagram using Dyck paths and for more information about the pyramid see A237593.

Examples

			Illustration of initial terms (n = 1..6):
.                                                      _ _ _ _
.                                        _ _ _        |_ _ _  |_
.                            _ _ _      |_ _ _|       |_ _ _|   |_
.                  _ _      |_ _  |_    |_ _  |_ _    |_ _  |_ _  |
.          _ _    |_ _|_    |_ _|_  |   |_ _|_  | |   |_ _|_  | | |
.    _    |_  |   |_  | |   |_  | | |   |_  | | | |   |_  | | | | |
.   |_|   |_|_|   |_|_|_|   |_|_|_|_|   |_|_|_|_|_|   |_|_|_|_|_|_|
.
.    4      6        8          12           14             20

Crossrefs

Cf. A000203, A024916, A196020, A235791, A236104, A237048, A237270, A237271, A237590, A237591, A237593, A245092, A262626, A294723.

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).
Cf. A000203, A001227, A196020, A235791, A237048, A237590, A237591, A237270, A237271, A237593, A245092, A244050, A262626, A280850, A280851, A280940, A285901, A294723, A296508.

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).
Cf. A000203, A196020, A235791, A237048, A237590, A237591, A237270, A237271, A237593, A245092, A244050, A262626, A280850, A280851, A280940, A285901, A296508, A317109.

Formula

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

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

Original entry on oeis.org

8, 14, 23, 33, 41, 55, 63, 77, 91, 108, 116, 134, 142, 158, 180, 202, 210, 232, 240
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 8 vertices, so a(1) = 8.

Links

Crossrefs

Cf. A325300 (number of faces), A325301 (number of edges).
Cf. A196020, A235791, A236104, A237270, A237271, A237591, A237593, A245092, A262626, A294723, A323648.

Formula

a(n) = A325301(n) - A325300(n) + 2 (Euler's formula).

A293750 a(n) is the total number of line segments that belong to the Dyck paths in the diagram of the symmetries of sigma described in A236104 and A237593 after n-th stage, with a(0) = 0.

Original entry on oeis.org

0, 2, 4, 6, 10, 12, 18, 20, 26, 30, 36, 38, 46, 48, 54, 62, 72, 74, 84, 86, 96, 104, 110, 112, 124, 130, 136, 144, 158, 160
Offset: 0

Views

Author

Omar E. Pol, Nov 09 2017

Keywords

Examples

			Illustration of initial terms (n = 1..6):
.                                                      _ _ _ _
.                                        _ _ _         _ _ _  |_
.                            _ _ _       _ _ _|        _ _ _|   |_
.                  _ _       _ _  |_     _ _  |_ _     _ _  |_ _  |
.          _ _     _ _|_     _ _|_  |    _ _|_  | |    _ _|_  | | |
.    _     _  |    _  | |    _  | | |    _  | | | |    _  | | | | |
.     |     | |     | | |     | | | |     | | | | |     | | | | | |
.
.    2      4        6          10           12             18
.

Crossrefs

Cf. A000203, A024916, A196020, A235791, A236104, A237048, A237270, A237271, A237590, A237591, A237593, A245092, A262626, A294723, A294847.

Formula

a(n) = A294847(n) - 2.
Showing 1-8 of 8 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.