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.

Previous Showing 11-20 of 44 results. Next

A280851 Irregular triangle read by rows in which row n lists the subparts of the symmetric representation of sigma(n), ordered by order of appearance in the structure, from left to right.

Original entry on oeis.org

1, 3, 2, 2, 7, 3, 3, 11, 1, 4, 4, 15, 5, 3, 5, 9, 9, 6, 6, 23, 5, 7, 7, 12, 12, 8, 7, 1, 8, 31, 9, 9, 35, 2, 2, 10, 10, 39, 3, 11, 5, 5, 11, 18, 18, 12, 12, 47, 13, 13, 5, 13, 21, 21, 14, 6, 6, 14, 55, 1, 15, 15, 59, 3, 7, 3, 16, 16, 63, 17, 7, 7, 17, 27, 27, 18, 9, 3, 18, 71, 10, 10, 19, 19, 30, 30
Offset: 1

Views

Author

Omar E. Pol, Jan 09 2017

Keywords

Comments

The terms in the n-th row are the same as the terms in the n-th row of triangle A279391, but in some rows the terms appear in distinct order.
First differs from A279391 at a(28) = T(15,3).
Also nonzero terms of A296508. - Omar E. Pol, Feb 11 2018

Examples

			Triangle begins (rows 1..16):
   1;
   3;
   2,  2;
   7;
   3,  3;
  11,  1;
   4,  4;
  15;
   5,  3,  5;
   9,  9;
   6,  6;
  23,  5;
   7,  7;
  12, 12;
   8,  7,  1,  8;
  31;
...
For n = 12 we have that the 11th row of triangle A237593 is [6, 3, 1, 1, 1, 1, 3, 6] and the 12th row of the same triangle is [7, 2, 2, 1, 1, 2, 2, 7], so the diagram of the symmetric representation of sigma(12) = 28 is constructed as shown below in Figure 1:
.                          _                                    _
.                         | |                                  | |
.                         | |                                  | |
.                         | |                                  | |
.                         | |                                  | |
.                         | |                                  | |
.                    _ _ _| |                             _ _ _| |
.                  _|    _ _|                           _|  _ _ _|
.                _|     |                             _|  _| |
.               |      _|                            |  _|  _|
.               |  _ _|                              | |_ _|
.    _ _ _ _ _ _| |     28                _ _ _ _ _ _| |    5
.   |_ _ _ _ _ _ _|                      |_ _ _ _ _ _ _|
.                                                       23
.
.   Figure 1. The symmetric            Figure 2. After the dissection
.   representation of sigma(12)        of the symmetric representation
.   has only one part which            of sigma(12) into layers of
.   contains 28 cells, so              width 1 we can see two subparts
.   the 12th row of the                that contain 23 and 5 cells
.   triangle A237270 is [28].          respectively, so the 12th row of
.                                      this triangle is [23, 5].
.
For n = 15 we have that the 14th row of triangle A237593 is [8, 3, 1, 2, 2, 1, 3, 8] and the 15th row of the same triangle is [8, 3, 2, 1, 1, 1, 1, 2, 3, 8], so the diagram of the symmetric representation of sigma(15) = 24 is constructed as shown below in Figure 3:
.                                _                                  _
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                          _ _ _|_|                           _ _ _|_|
.                      _ _| |      8                      _ _| |      8
.                     |    _|                            |  _ _|
.                    _|  _|                             _| |_|
.                   |_ _|  8                           |_ _|  1
.                   |                                  |    7
.    _ _ _ _ _ _ _ _|                   _ _ _ _ _ _ _ _|
.   |_ _ _ _ _ _ _ _|                  |_ _ _ _ _ _ _ _|
.                    8                                  8
.
.   Figure 3. The symmetric            Figure 4. After the dissection
.   representation of sigma(15)        of the symmetric representation
.   has three parts of size 8          of sigma(15) into layers of
.   because every part contains        width 1 we can see four "subparts".
.   8 cells, so the 15th row of        The first layer has three subparts:
.   triangle A237270 is [8, 8, 8].     [8, 7, 8]. The second layer has
.                                      only one subpart of size 1. The
.                                      15th row of this triangle is
.                                      [8, 7, 1, 8].
.
From _Hartmut F. W. Hoft_, Jan 31 2018: (Start)
The subparts of 36 whose symmetric representation of sigma has maximum width 2 are 71, 10, and 10.
The (size, width level) pairs of the six subparts of the symmetric representation of sigma(63) which consists of five parts are (32,1), (12,1), (11,1), (5,2), (12,1), and (32,1).
The subparts of perfect number 496 are 991, the length of its entire Dyck path, and 1 at the diagonal.
Number 10080, the smallest number whose symmetric representation of sigma has maximum width 10 (see A250070), has 12 subparts; its (size, width level) pairs are (20159,1), (6717,2), (4027,3), (2873,4), (2231,5), (1329,6), (939,7), (541,8), (403,9), (3,10), (87,10), and (3,10). The size of the first subpart is the length of the entire Dyck path so that the symmetric representation consists of a single part. The first subpart at the 10th level occurs at coordinates (6926,7055) ... (6929,7055). (End)
From _Omar E. Pol_, Dec 26 2020: (Start)
Also consider the infinite double-staircases diagram defined in A335616 (see the theorem).
For n = 15 the diagram with first 15 levels looks like this:
.
Level                         "Double-staircases" diagram
.                                          _
1                                        _|1|_
2                                      _|1 _ 1|_
3                                    _|1  |1|  1|_
4                                  _|1   _| |_   1|_
5                                _|1    |1 _ 1|    1|_
6                              _|1     _| |1| |_     1|_
7                            _|1      |1  | |  1|      1|_
8                          _|1       _|  _| |_  |_       1|_
9                        _|1        |1  |1 _ 1|  1|        1|_
10                     _|1         _|   | |1| |   |_         1|_
11                   _|1          |1   _| | | |_   1|          1|_
12                 _|1           _|   |1  | |  1|   |_           1|_
13               _|1            |1    |  _| |_  |    1|            1|_
14             _|1             _|    _| |1 _ 1| |_    |_             1|_
15            |1              |1    |1  | |1| |  1|    1|              1|
.
Starting from A196020 and after the algorithm described in A280850 and A296508 applied to the above diagram we have a new diagram as shown below:
.
Level                             "Ziggurat" diagram
.                                          _
6                                         |1|
7                            _            | |            _
8                          _|1|          _| |_          |1|_
9                        _|1  |         |1   1|         |  1|_
10                     _|1    |         |     |         |    1|_
11                   _|1      |        _|     |_        |      1|_
12                 _|1        |       |1       1|       |        1|_
13               _|1          |       |         |       |          1|_
14             _|1            |      _|    _    |_      |            1|_
15            |1              |     |1    |1|    1|     |              1|
.
The 15th row
of A249351 :  [1,1,1,1,1,1,1,1,0,0,0,1,1,1,2,1,1,1,0,0,0,1,1,1,1,1,1,1,1]
The 15th row
of A237270:   [              8,            8,            8              ]
The 15th row
of A296508:   [              8,      7,    1,    0,      8              ]
The 15th row
of triangle   [              8,      7,    1,            8              ]
.
More generally, for n >= 1, it appears there is the same correspondence between the original diagram of the symmetric representation of sigma(n) and the "Ziggurat" diagram of n.
For the definition of subparts see A279387 and also A296508. (End)
		

Crossrefs

Row sums give A000203.
The length of row n equals A001227(n).
Hence, if n is odd the length of row n equals A000005(n).
For the definition of "subparts" see A279387.
For the triangle of sums of subparts see A279388.

Programs

  • Mathematica
    row[n_] := Floor[(Sqrt[8n+1]-1)/2]
    f[n_] := Map[Ceiling[(n+1)/#-(#+1)/2] - Ceiling[(n+1)/(#+1)-(#+2)/2]&, Range[row[n]]]
    a237593[n_] := Module[{a=f[n]}, Join[a, Reverse[a]]]
    g[n_] := Map[If[Mod[n - #*(#+1)/2, #]==0, (-1)^(#+1), 0]&, Range[row[n]]]
    a262045[n_] := Module[{a=Accumulate[g[n]]}, Join[a, Reverse[a]]]
    findStart[list_] := Module[{i=1}, While[list[[i]]==0, i++]; i]
    a280851[n_] := Module[{lenL=a237593[n], widL=a262045[n], r=row[n], subs={}, acc, start, i}, While[!AllTrue[widL, #==0&], start=findStart[widL]; acc=lenL[[start]]; widL[[start]]-=1; i=start+1; While[i<=2*r && acc!=0, If[widL[[i]]==0, If[start<=r2*r && acc!=0, If[start<=r2] (* triangle *) (* Hartmut F. W. Hoft, Jan 31 2018 *)

Extensions

Name clarified by Hartmut F. W. Hoft and Omar E. Pol, Jan 31 2018

A239657 Number of odd divisors m of n such that there is a divisor d of n with d < m < 2*d.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 3, 0, 0, 0, 0, 1, 2, 0, 0, 0, 1, 0, 3, 0, 0, 3, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 3, 0, 0, 1, 0, 0, 3, 0, 0, 0, 1, 0, 2, 0, 0, 2, 0, 1, 2, 0, 1, 0, 0, 0, 3, 0, 0, 0, 1, 0, 5, 1, 0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 2, 0, 1, 4, 0, 0, 3, 0, 1, 0, 1, 0, 2, 0, 0, 1, 0, 0, 3, 0, 0, 0, 0, 0, 5, 0, 0
Offset: 1

Views

Author

Omar E. Pol, Mar 23 2014

Keywords

Comments

The original name was: Number of odd divisors of n minus the number of parts in the symmetric representation of sigma(n).
Observation: at least the indices of the first 42 positive elements coincide with A005279: 6, 12, 15, 18, 20, 24..., checked (by hand) up to n = 2^7.
The observation is true for the indices of all positive elements. Hence the indices of the zeros give A174905. - Omar E. Pol, Jan 06 2017
a(n) is the number of subparts minus the number of parts in the symmetric representation of sigma(n). For the definition of "subpart" see A279387. - Omar E. Pol, Sep 26 2018
a(n) is the number of subparts of the symmetric representation of sigma(n) that are not in the first layer. - Omar E. Pol, Jan 26 2025

Examples

			Illustration of the symmetric representation of sigma(15) = 24 in the third quadrant:
.      _
.     | |
.     | |
.     | |
.     | |
.     | |
.     | |
.     | |
.     |_|_ _ _
.    8      | |_ _
.           |_    |
.             |_  |_
.            8  |_ _|
.                   |
.                   |_ _ _ _ _ _ _ _
.                   |_ _ _ _ _ _ _ _|
.                 8
.
For n = 15 the divisors of 15 are 1, 3, 5, 15, so the number of odd divisors of 15 is equal to 4. On the other hand the parts of the symmetric representation of sigma(15) are [8, 8, 8], there are three parts, so a(15) = 4 - 3 = 1.
From _Omar E. Pol_, Sep 26 2018: (Start)
Also the number of odd divisors of 15 equals the number of partitions of 15 into consecutive parts and equals the number of subparts in the symmetric representation of sigma(15). Then we have that the number of subparts minus the number of parts is  4 - 3 = 1, so a(15) = 1.
.      _
.     | |
.     | |
.     | |
.     | |
.     | |
.     | |
.     | |
.     |_|_ _ _
.    8      | |_ _
.           |_ _  |
.          7  |_| |_
.            1  |_ _|
.                   |
.                   |_ _ _ _ _ _ _ _
.                   |_ _ _ _ _ _ _ _|
.                 8
.
The above diagram shows the symmetric representation of sigma(15) with its four subparts: [8, 7, 1, 8]. (End)
From _Omar E. Pol_, Mar 30 2025: (Start)
The above diagram also shows that in the first layer there are three parts (having sizes [8, 7, 8]). Also there is another part that is not in the first layer, so a(15) = 1.
On the other hand for n = 15 there is only one odd divisor m of 15 such that  d < m < 2*d and d divides 15. That odd divisor is 5 as shown below, so a(15) = 1.
   d  <  m  <  2*d
--------------------
   1            2
   3     5      6
   5           10
  15           30
.
For n = 18 there are two odd divisors m of 18 such that  d < m < 2*d and d divides 18. Those odd divisors are 3 and 9 as shown below, so a(18) = 2.
   d  <  m  <  2*d
--------------------
   1            2
   2     3      4
   3            6
   6     9     12
   9           18
  18           36
.
(End)
		

Crossrefs

Programs

Formula

a(n) = A001227(n) - A237271(n).

Extensions

New Name from Omar E. Pol, Jan 26 2025

A279391 Irregular triangle read by rows in which row n lists the subparts of the successive layers of the symmetric representation of sigma(n).

Original entry on oeis.org

1, 3, 2, 2, 7, 3, 3, 11, 1, 4, 4, 15, 5, 3, 5, 9, 9, 6, 6, 23, 5, 7, 7, 12, 12, 8, 7, 8, 1, 31, 9, 9, 35, 2, 2, 10, 10, 39, 3, 11, 5, 5, 11, 18, 18, 12, 12, 47, 13, 13, 5, 13, 21, 21, 14, 6, 6, 14, 55, 1, 15, 15, 59, 3, 7, 3, 16, 16, 63, 17, 7, 7, 17, 27, 27, 18, 9, 18, 3, 71, 10, 10, 19, 19, 30, 30
Offset: 1

Views

Author

Omar E. Pol, Dec 12 2016

Keywords

Comments

Note that the terms in the n-th row are the same as the terms in the n-th row of triangle A280851, but in some rows the terms appear in distinct order. First differs from A280851 at a(28) = T(15,3). - Omar E. Pol, Apr 24 2018
Row n in the triangle is a sequence of A250068(n) symmetric sections, each section consisting of the sizes of the subparts on that level in the symmetric representation of sigma of n - from the top down in the images below or left to right as drawn in A237593. - Hartmut F. W. Hoft, Sep 05 2021

Examples

			Triangle begins (first 15 rows):
   [1];
   [3];
   [2, 2];
   [7];
   [3, 3];
   [11], [1];
   [4, 4];
   [15];
   [5, 3, 5];
   [9, 9];
   [6, 6];
   [23], [5];
   [7, 7];
   [12, 12];
   [8, 7, 8], [1];
  ...
For n = 12 we have that the 11th row of triangle A237593 is [6, 3, 1, 1, 1, 1, 3, 6] and the 12th row of the same triangle is [7, 2, 2, 1, 1, 2, 2, 7], so the diagram of the symmetric representation of sigma(12) = 28 is constructed as shown below in Figure 1:
.                          _                                    _
.                         | |                                  | |
.                         | |                                  | |
.                         | |                                  | |
.                         | |                                  | |
.                         | |                                  | |
.                    _ _ _| |                             _ _ _| |
.                  _|    _ _|                           _|  _ _ _|
.                _|     |                             _|  _| |
.               |      _|                            |  _|  _|
.               |  _ _|                              | |_ _|
.    _ _ _ _ _ _| |    28                 _ _ _ _ _ _| |    5
.   |_ _ _ _ _ _ _|                      |_ _ _ _ _ _ _|
.                                                       23
.
.   Figure 1. The symmetric            Figure 2. After the dissection
.   representation of sigma(12)        of the symmetric representation
.   has only one part which            of sigma(12) into layers of
.   contains 28 cells, so              width 1 we can see two "subparts"
.   the 12th row of the                that contain 23 and 5 cells
.   triangle A237270 is [28].          respectively, so the 12th row of
.                                      this triangle is [23], [5].
.
For n = 15 we have that the 14th row of triangle A237593 is [8, 3, 1, 2, 2, 1, 3, 8] and the 15th row of the same triangle is [8, 3, 2, 1, 1, 1, 1, 2, 3, 8], so the diagram of the symmetric representation of sigma(15) = 24 is constructed as shown below in Figure 3:
.                                _                                  _
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                               | |                                | |
.                          _ _ _|_|                           _ _ _|_|
.                      _ _| |      8                      _ _| |      8
.                     |    _|                            |  _ _|
.                    _|  _|                             _| |_|
.                   |_ _|  8                           |_ _|  1
.                   |                                  |    7
.    _ _ _ _ _ _ _ _|                   _ _ _ _ _ _ _ _|
.   |_ _ _ _ _ _ _ _|                  |_ _ _ _ _ _ _ _|
.                    8                                  8
.
.   Figure 3. The symmetric            Figure 4. After the dissection
.   representation of sigma(15)        of the symmetric representation
.   has three parts of size 8          of sigma(15) into layers of
.   because every part contains        width 1 we can see four "subparts".
.   8 cells, so the 15th row of        The first layer has three subparts:
.   triangle A237270 is [8, 8, 8].     8, 7, 8. The second layer has
.                                      only one subpart of size 1, so
.                                      the 15th row of this triangle is
.                                      [8, 7, 8], [1].
.
The smallest even number with 3 levels is 60; its row of subparts is: [119], [37], [6, 6]. The smallest odd number with 3 levels is 315; its row of subparts is:  [158, 207, 158], [11, 26, 5, 9, 5, 26, 11], [4, 4]. - _Hartmut F. W. Hoft_, Sep 05 2021
		

Crossrefs

The length of row n equals A001227(n).
If n is odd the length of row n equals A000005(n).
Row sums give A000203.
For the definition of "subparts" see A279387.
For the triangle of sums of subparts see A279388.

Programs

  • Mathematica
    (* support functions are defined in aA237593 and A262045 *)
    subP[level_] := Module[{s=Map[Apply[Plus, #]&, Select[level, First[#]!=0&]]}, If[OddQ[Length[s]], s[[(Length[s]+1)/2]]-=1]; s]
    a279391[n_] := Module[{widL=a262045[n], lenL=a237593[n], srs, subs}, srs=Transpose[Map[PadRight[If[widL[[#]]>0, Table[1, widL[[#]]], {0}], Max[widL]]&, Range[Length[lenL]]]]; subs=Map[SplitBy[lenL srs[[#]], #!=0&]&, Range[Max[widL]]]; Flatten[Map[subP, subs]]]
    Flatten[Map[a279391, Range[38]]] (* Hartmut F. W. Hoft, Sep 05 2021 *)

A238005 Number of partitions of n into distinct parts such that (greatest part) - (least part) = (number of parts).

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 1, 2, 0, 2, 2, 2, 2, 2, 1, 4, 3, 2, 3, 3, 2, 4, 4, 4, 3, 4, 2, 5, 5, 3, 5, 6, 3, 5, 3, 5, 6, 6, 4, 6, 6, 4, 6, 6, 3, 7, 7, 7, 6, 6, 5, 7, 7, 5, 6, 8, 6, 8, 8, 6, 8, 8, 4, 9, 6, 7, 9, 9, 7, 7, 9, 8, 9, 9, 5, 9, 7, 8, 10, 10
Offset: 1

Views

Author

Clark Kimberling, Feb 17 2014

Keywords

Comments

Note that partitions into distinct parts are also called strict partitions.
a(n) is the number of strict partitions of n into nearly consecutive parts, that is, the number of ways to write n as a sum of terms i, i+1, i+2, ..., i+k (i>=1, k>=2) where one of the interior parts i+1, i+2, ..., i+k-1 is missing. Examples of nearly consecutive partitions (corresponding to the initial nonzero values of a(n)) are 13, 24, 124, 134, 35, 235, 46, ... . - Don Reble, Sep 07 2021
Let T(n) = n*(n+1)/2 = A000217(n) denote the n-th triangular number.
Theorem A. a(n) = b(n) - c(n), where b(n) is the inverse triangular number sequence A003056, that is, b(n) is the maximal i such that T_i <= n, and c(n) is the number of partitions of n into consecutive parts = number of odd divisors of n = A001227(n).
This theorem was conjectured by Omar E. Pol in February 2018, and proved independently by William J. Keith and Roland Bacher on Sep 05 2021. The elegant proof given in the link below is due to Don Reble.

Examples

			a(8) = 2 counts these partitions:  53, 431.
		

Crossrefs

a(n) is also the number of zeros in the n-th row of the triangles A196020, A211343, A231345, A236106, A237048 (simpler), A239662, A261699, A271344, A272026, A280850, A285574, A285891, A285914, A286013, A296508 (and possibly others). Omar E. Pol, Feb 17 2018
Row sums of A347579. - Omar E. Pol, Sep 07 2021

Programs

  • Mathematica
    z = 70; q[n_] := q[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; p1[p_] := p1[p] = DeleteDuplicates[p]; t[p_] := t[p] = Length[p1[p]];
    Table[Count[q[n], p_ /; Max[p] - Min[p] < t[p]], {n, z}]  (* A001227 *)
    Table[Count[q[n], p_ /; Max[p] - Min[p] <= t[p]], {n, z}] (* A003056 *)
    Table[Count[q[n], p_ /; Max[p] - Min[p] == t[p]], {n, z}] (* A238005 *)
    Table[Count[q[n], p_ /; Max[p] - Min[p] > t[p]], {n, z}]  (* A238006 *)
    Table[Count[q[n], p_ /; Max[p] - Min[p] >= t[p]], {n, z}] (* A238007 *)
    {0}~Join~Array[Floor[(Sqrt[1 + 8 #] - 1)/2] - DivisorSum[#, 1 &, OddQ] &, 102] (* Michael De Vlieger, Feb 18 2018 *)
  • PARI
    a(n) = if (n, (sqrtint(8*n+1)-1)\2 - sumdiv(n, d, d%2), 0); \\ Michel Marcus, Mar 01 2018

Formula

G.f. = (x/(1-x)) * Sum_{k >= 1} x^(k*(k+1)/2) * (1 - x^(k-1)) / (1 - x^k). This follows from Theorem A and the g.f.s for A003056 and A001227. - William J. Keith, Sep 05 2021
a(n) = A238007(n) - A238006(n). - Omar E. Pol, Sep 11 2021
A001227(n) + a(n) + A238006(n) = A000009(n). - R. J. Mathar, Sep 23 2021

Extensions

Edited by N. J. A. Sloane, Sep 11 2021, mostly to add Theorem A.

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.
.
		

Crossrefs

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.

A319796 Even numbers that have middle divisors, where "middle divisor" means a divisor in the half-open interval [sqrt(n/2), sqrt(n*2)).

Original entry on oeis.org

2, 4, 6, 8, 12, 16, 18, 20, 24, 28, 30, 32, 36, 40, 42, 48, 50, 54, 56, 60, 64, 66, 70, 72, 80, 84, 88, 90, 96, 98, 100, 104, 108, 110, 112, 120, 126, 128, 130, 132, 140, 144, 150, 154, 156, 160, 162, 168, 170, 176, 180, 182, 190, 192, 196, 198, 200, 204, 208, 210, 216, 220, 224, 228, 234, 238, 240, 242, 252, 256
Offset: 1

Views

Author

Omar E. Pol, Sep 28 2018

Keywords

Comments

Even numbers k such that the symmetric representation of sigma(k) has an odd number of parts.
An even number A005843 is in this sequence iff A067742(t) != 0.
For the definition of middle divisors, see A067742.
For more information about the symmetric representation of sigma(k) see A237593.
From Hartmut F. W. Hoft, Mar 28 2023: (Start)
By Theorem 1 (iii) in A067742, the number of middle divisors of a(n) equals the width of the symmetric representation of sigma(a(n)), SRS(a(n)), on the diagonal which equals the triangle entry A249223(n, A003056(n)). The maximum widths of the center part of SRS(a(n)) need not occur at the diagonal.
For example, a(7) = 2 * 3^2 = 18, SRS(18) has a single part with maximum width 2 while its width at the diagonal equals 1 = A067742(18), and divisor 3 is the only middle divisor of a(7). (End)

Examples

			6 is in the sequence because it's an even number and the symmetric representation of sigma(6) = 12 has an odd number of parts (more exactly only one part), as shown below:
.    _ _ _ _
.   |_ _ _  |_ 12
.         |   |_
.         |_ _  |
.             | |
.             | |
.             |_|
.
Also 50 is in the sequence because it's an even number and the symmetric representation of sigma(50) = 93 has an odd number of parts (more exactly three parts), they are [39, 15, 39].
a(34) = 110 = 2 * 5 * 11 has 10 and 11 as its middle divisors, and SRS(a(34)) has 3 parts and width 2 at the diagonal. -  _Hartmut F. W. Hoft_, Mar 28 2023
		

Crossrefs

Programs

  • Maple
    filter:= n -> ormap(t -> t^2 >= n/2 and t^2 < 2*n, numtheory:-divisors(n)):
    select(filter, 2*[$1..1000]); # Robert Israel, Mar 29 2023
  • Mathematica
    middleDiv[n_] := Select[Divisors[n], Sqrt[n/2]<=#Hartmut F. W. Hoft, Mar 28 2023 *)

Extensions

Name clarified by Omar E. Pol, Mar 28 2023

A266531 Square array read by antidiagonals upwards: T(n,k) = n-th number with k odd divisors.

Original entry on oeis.org

1, 2, 3, 4, 5, 9, 8, 6, 18, 15, 16, 7, 25, 21, 81, 32, 10, 36, 27, 162, 45, 64, 11, 49, 30, 324, 63, 729, 128, 12, 50, 33, 625, 75, 1458, 105, 256, 13, 72, 35, 648, 90, 2916, 135, 225, 512, 14, 98, 39, 1250, 99, 5832, 165, 441, 405, 1024, 17, 100, 42, 1296, 117, 11664, 189, 450, 567, 59049, 2048, 19, 121, 51, 2401, 126, 15625
Offset: 1

Views

Author

Omar E. Pol, Apr 02 2016

Keywords

Comments

T(n,k) is the n-th positive integer with exactly k odd divisors.
This is a permutation of the natural numbers.
T(n,k) is also the n-th number j with the property that the symmetric representation of sigma(j) has k subparts (cf. A279387). - Omar E. Pol, Dec 27 2016
T(n,k) is also the n-th positive integer with exactly k partitions into consecutive parts. - Omar E. Pol, Aug 16 2018

Examples

			The corner of the square array begins:
    1,  3,  9, 15,   81,  45,   729, 105,  225,  405, ...
    2,  5, 18, 21,  162,  63,  1458, 135,  441,  567, ...
    4,  6, 25, 27,  324,  75,  2916, 165,  450,  810, ...
    8,  7, 36, 30,  625,  90,  5832, 189,  882,  891, ...
   16, 10, 49, 33,  648,  99, 11664, 195,  900, 1053, ...
   32, 11, 50, 35, 1250, 117, 15625, 210, 1089, 1134, ...
   64, 12, 72, 39, 1296, 126, 23328, 231, 1225, 1377, ...
  128, 13, 98, 42, 2401, 147, 31250, 255, 1521, 1539, ...
  ...
		

Crossrefs

A319529 Odd numbers that have middle divisors.

Original entry on oeis.org

1, 9, 15, 25, 35, 45, 49, 63, 77, 81, 91, 99, 117, 121, 135, 143, 153, 165, 169, 187, 195, 209, 221, 225, 231, 247, 255, 273, 285, 289, 299, 315, 323, 325, 345, 357, 361, 375, 391, 399, 405, 425, 435, 437, 441, 459, 475, 483, 493, 513, 525, 527, 529, 551, 561, 567, 575, 589, 609, 621, 625, 627, 651
Offset: 1

Views

Author

Omar E. Pol, Sep 23 2018

Keywords

Comments

Odd numbers k such that the symmetric representation of sigma(k) has an odd number of parts.
From Felix Fröhlich, Sep 25 2018: (Start)
For the definition of middle divisors, see A067742.
Let t be a term of A005408. Then t is in this sequence iff A067742(t) != 0. (End)
From Hartmut F. W. Hoft, May 24 2022: (Start)
By Theorem 1 (iii) in A067742, the number of middle divisors of a(n) equals the width of the symmetric representation of sigma(a(n)) on the diagonal which equals the triangle entry A249223(n, A003056(n)).
All terms in sequence A016754 have an odd number of middle divisors, forming a subsequence of this sequence; A016754(18) = a(116) = 1225 = 5^2 * 7^2 is the smallest number in A016754 with 3 middle divisors: 25, 35, 49.
Sequence A259417 is a subsequence of this sequence and of A320137 since an even power of a prime has a single middle divisor.
The maximum widths of the center part of the symmetric representation of sigma(a(n)), SRS(a(n)), need not occur at the diagonal. For example, a(304) = 3^3 * 5^3 = 3375, SRS(3375) has 3 parts, its center part has maximum width 3 while its width at the diagonal equals 2 = A067742(3375), and divisors 45 and 75 are the two middle divisors of a(304). (End)

Examples

			9 is in the sequence because it's an odd number and the symmetric representation of sigma(9) = 13 has an odd number of parts (more exactly three parts), as shown below:
.
.     _ _ _ _ _ 5
.    |_ _ _ _ _|
.              |_ _ 3
.              |_  |
.                |_|_ _ 5
.                    | |
.                    | |
.                    | |
.                    | |
.                    |_|
.
		

Crossrefs

Programs

  • Mathematica
    middleDiv[n_] := Select[Divisors[n], Sqrt[n/2]<=#Hartmut F. W. Hoft, May 24 2022 *)
  • Python
    from itertools import islice, count
    from sympy import divisors
    def A319529_gen(startvalue=1): # generator of terms >= startvalue
        for k in count(max(1,startvalue+1-(startvalue&1)),2):
            if any((k <= 2*d**2 < 4*k for d in divisors(k,generator=True))):
                yield k
    A319529_list = list(islice(A319529_gen(startvalue=11),40)) # Chai Wah Wu, Jun 09 2022

A319802 Even numbers without middle divisors.

Original entry on oeis.org

10, 14, 22, 26, 34, 38, 44, 46, 52, 58, 62, 68, 74, 76, 78, 82, 86, 92, 94, 102, 106, 114, 116, 118, 122, 124, 134, 136, 138, 142, 146, 148, 152, 158, 164, 166, 172, 174, 178, 184, 186, 188, 194, 202, 206, 212, 214, 218, 222, 226, 230, 232, 236, 244, 246, 248, 250, 254, 258, 262, 268, 274, 278, 282, 284
Offset: 1

Views

Author

Omar E. Pol, Sep 28 2018

Keywords

Comments

Even numbers k such that the symmetric representation of sigma(k) has an even number of parts.
For the definition of middle divisors, see A067742.
For more information about the symmetric representation of sigma(k) see A237593.
Let p be a prime > 5. Then a(n) is a number of the form m*p where m is an even number < sqrt(p). - David A. Corneth, Sep 28 2018
First differs from A244894 at a(51) = 230. - R. J. Mathar, Oct 04 2018
Is this twice A101550? - Omar E. Pol, Oct 04 2018
This sequence is not twice A101550: first differs at a(57) = 250 != 254 = 2*A101550(57). - Michael S. Branicky, Oct 14 2021

Examples

			10 is in the sequence because it's an even number and the symmetric representation of sigma(10) = 18 has an even number of parts as shown below:
.
.     _ _ _ _ _ _ 9
.    |_ _ _ _ _  |
.              | |_
.              |_ _|_
.                  | |_ _ 9
.                  |_ _  |
.                      | |
.                      | |
.                      | |
.                      | |
.                      |_|
.
		

Crossrefs

Programs

  • Python
    from sympy import divisors
    def ok(n):
        if n < 2 or n%2 == 1: return False
        return not any(n//2 <= d*d < 2*n for d in divisors(n, generator=True))
    print(list(filter(ok, range(285)))) # Michael S. Branicky, Oct 14 2021

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
Previous Showing 11-20 of 44 results. Next