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 41-50 of 78 results. Next

A276112 Numbers with precipice 1: descending by the main diagonal of the pyramid described in A245092, the height difference between the level a(n) (starting from the top) and the level of the next terrace is equal to 1.

Original entry on oeis.org

1, 3, 5, 7, 8, 11, 14, 15, 17, 19, 23, 24, 27, 29, 31, 34, 35, 39, 41, 44, 47, 48, 49, 53, 55, 59, 62, 63, 65, 69, 71, 76, 79, 80, 83, 87, 89, 90, 95, 97, 98, 99, 103, 107, 109, 111, 116, 119, 120, 125, 127, 129, 131, 134, 139, 142, 143, 149, 152, 153, 155, 159
Offset: 1

Views

Author

Omar E. Pol, Jan 02 2017

Keywords

Comments

The structure of the stepped pyramid arises after the 90-degree-zig-zag folding of the diagram of the isosceles triangle A237593.
The terraces at the k-th level of the pyramid are also the parts of the symmetric representation of sigma(k).
The stepped pyramid is also one of the 3D-quadrants of the stepped pyramid described in A244050.
For more information about the precipices see A277437, A280223 and A280295.
From Hartmut F. W. Hoft, Feb 02 2022: (Start)
Also partial sums of A280919.
a(n) is also the largest number of a Dyck path that crosses the diagonal at point A282131(n) which also is the rightmost number in each nonzero row of the irregular triangle in A279385. (End)

Examples

			From _Hartmut F. W. Hoft_, Feb 02 2022: (Start)
      n: 1  2  3  4  5  6  7  8  9 10 11 12 13 14 index.
A282131: 1  2  3  5  6  7  9 11 12 13 15 17 18 20 position on diagonal.
A276112: 1  3  5  7  8 11 14 15 17 19 23 24 27 29 max index of Dyck path.
A280919: 1  2  2  2  1  3  3  1  2  2  4  1  3  2 paths at diag position.
(End)
		

Crossrefs

Programs

  • Mathematica
    (* last computed value of a280919[ ] is dropped to avoid a potential undercount of crossings *)
    a240542[n_] := Sum[(-1)^(k+1)Ceiling[(n+1)/k-(k+1)/2], {k, 1, Floor[-1/2+1/2 Sqrt[8n+1]]}]
    a280919[n_] := Most[Map[Length, Split[Map[a240542, Range[n]]]]]
    A276112[160] (* Hartmut F. W. Hoft, Feb 02 2022 *)

Formula

a(n) = A071562(n+1) - 1.
a(n) = Sum_{i=1..n} A280919(i), n >= 1. - Hartmut F. W. Hoft, Feb 02 2022

A279228 Number of unit steps that are shared by the smallest and largest Dyck path of the symmetric representation of sigma(n).

Original entry on oeis.org

0, 0, 0, 0, 2, 0, 4, 0, 2, 0, 8, 0, 10, 2, 4, 0, 14, 0, 16, 0, 6, 6, 20, 0, 16, 8, 10, 0, 26, 0, 28, 0
Offset: 1

Views

Author

Omar E. Pol, Dec 08 2016

Keywords

Comments

a(n) is also the number of unit steps that are shared by the largest Dyck path of the symmetric representation of sigma(n) and the largest Dyck path of the symmetric representation of sigma(n-1), in a quadrant of the square grid.
For more information about the Dyck paths of the symmetric representation of sigma(n) see A237593.

Examples

			Illustration of initial terms (n = 1..12) using the spiral described in A239660:
.               _ _ _ _ _ _
.              |  _ _ _ _ _|_ _ _ _ _
.         0   _| |         |_ _ _ _ _|
.           _|_ _|                   |_ _ 2
.       _ _| |      _ _ _ _          |_  |
.      |  _ _|  0 _|  _ _ _|_ _ _      |_|_ _
.      | |      _|   |     |_ _ _|  2      | |
.      | |     |  _ _|           |_ _      | |
.      | |     | |    0 _ _        | |     | |
.      | |     | |     |  _|_ 0    | |     | |
.     _|_|    _|_|    _|_| |_|    _|_|    _|_|    _
.    | |     | |     | |         | |     | |     | |
.    | |     | |     |_|_ _     _| |     | |     | |
.    | |     | |      0|_ _|_ _|  _|     | |     | |
.    | |     |_|_          |_ _ _|0   _ _| |     | |
.    | |         |_                 _|  _ _|     | |
.    |_|_ _     4  |_ _ _ _        |  _|    _ _ _| |
.          |_      |_ _ _ _|_ _ _ _| |  0 _|    _ _|
.            |_            |_ _ _ _ _|  _|     |
.         8    |                       |      _|
.              |_ _ _ _ _ _            |  _ _|
.              |_ _ _ _ _ _|_ _ _ _ _ _| |      0
.                          |_ _ _ _ _ _ _|
.
.
For an illustration of the following examples see the last lap of the above spiral starting in the first quadrant.
For n = 9 the Dyck paths of the symmetric representation of sigma(9) share 2 unit steps, so a(9) = 2.
For n = 10 the Dyck paths of the symmetric representation of sigma(10) meet at the center, but they do not share unit steps, so a(10) = 0.
For n = 11 the Dyck paths of the symmetric representation of sigma(11) share 8 unit steps, so a(11) = 8.
For n = 12 the Dyck paths of the symmetric representation of sigma(12) do not share unit steps, so a(12) = 0.
Note that we can find the spiral on the terraces of the stepped pyramid described in A244050.
		

Crossrefs

Cf. A279029 gives the indices of the zero values.
Cf. A279244 gives the indices of the positive values.

Formula

a(n) = 2*n - A244363(n) = 2*(n - A244361(n)).
a(n) = A008586(n) - A348705(n). - Omar E. Pol, Dec 13 2021

A281010 Triangle read by rows in which row 2n-1 lists the widths of the symmetric representation of sigma(n), and row 2n lists a finite sequence S together with -1, with the property that the partial sums of S give the row 2n-1.

Original entry on oeis.org

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

Views

Author

Omar E. Pol, Jan 12 2017

Keywords

Comments

The row 2n-1 lists the widths of the terraces at the n-th level (starting from the top) of the pyramid described in A245092.
The sum of the areas of these terraces equals A000203(n): the sum of the divisors of n.
The k-th element of row 2n is associated to the k-th vertical cells at the n-th level of the pyramid.
The row 2n shows where the subparts (or subregions) of the terraces starting and ending, in accordance with the values 1 or -1.
The number of subparts in the n-th terrace equals A001227(n): the number of odd divisors of n.
If n is odd then the number of subparts in the n-th terrace is also A000005(n): the number of divisors of n.

Examples

			Triangle begins:
1;
1,-1;
1, 1, 1;
1, 0, 0,-1;
1, 1, 0, 1, 1;
1, 0,-1, 1, 0;-1;
1, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0, 0,-1;
1, 1, 1, 0, 0, 0, 1, 1, 1;
1, 0, 0,-1, 0, 0, 1, 0, 0,-1;
1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 1,-1, 0, 0, 0, 0,-1;
1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1;
1, 0, 0, 0,-1, 0, 0, 0, 0, 1, 0, 0, 0,-1;
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,-1;
1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0,-1, 0, 1, 0, 0,-1, 0, 1, 0, 0, 0, 0,-1;
1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0, 0, 0, 0,-1, 1, 0, 0, 0, 0, 0, 0, 0, 0,-1;
1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0,-1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0,-1;
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,-1, 0, 0, 0, 0, 0, 0, 0, 0,-1;
...
Written as an isosceles triangle the sequence begins:
.
.                                        1;
.                                      1, -1;
.                                    1,  1,  1;
.                                  1,  0,  0, -1;
.                                1,  1,  0,  1,  1;
.                              1,  0, -1,  1,  0, -1;
.                            1,  1,  1,  1,  1,  1,  1;
.                          1,  0,  0,  0,  0,  0,  0, -1;
.                        1,  1,  1,  0,  0,  0,  1,  1,  1;
.                      1,  0,  0, -1,  0,  0,  1,  0,  0, -1;
.                    1,  1,  1,  1,  1,  2,  1,  1,  1,  1,  1;
.                  1,  0,  0,  0,  0,  1, -1,  0,  0,  0,  0, -1;
.                1,  1,  1,  1,  0,  0,  0,  0,  0,  1,  1,  1,  1;
.              1,  0,  0,  0, -1,  0,  0,  0,  0,  1,  0,  0,  0, -1;
.            1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1;
.          1,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0, -1;
.        1,  1,  1,  1,  1,  0,  0,  1,  1,  1,  0,  0,  1,  1,  1,  1,  1;
.      1,  0,  0,  0,  0, -1,  0,  1,  0,  0, -1,  0,  1,  0,  0,  0,  0, -1;
.    1,  1,  1,  1,  1,  1,  1,  1,  1,  0,  1,  1,  1,  1,  1,  1,  1,  1,  1;
.  1,  0,  0,  0,  0,  0,  0,  0,  0, -1,  1,  0,  0,  0,  0,  0,  0,  0,  0, -1;
...
		

Crossrefs

The sum of row 2n-1 is A000203(n).
The sum of row 2n is A000004(n) = 0.
The number of positive terms in row 2n is A001227(n).
The number of nonzero terms in row 2n is A054844(n).
Middle diagonal (or central column of the isosceles triangle) gives A067742.
Row 2n-1 is also the n-th row of A249351.
Row 2n is also the n-th row of A281011.
Row 2n-1 lists the partial sums of the terms, except the last term, of the row 2n.

A317303 Numbers k such that both Dyck paths of the symmetric representation of sigma(k) have a central peak.

Original entry on oeis.org

2, 7, 8, 9, 16, 17, 18, 19, 20, 29, 30, 31, 32, 33, 34, 35, 46, 47, 48, 49, 50, 51, 52, 53, 54, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 154, 155, 156, 157, 158, 159, 160
Offset: 1

Views

Author

Omar E. Pol, Aug 27 2018

Keywords

Comments

Also triangle read by rows which gives the odd-indexed rows of triangle A014132.
There are no triangular number (A000217) in this sequence.
For more information about the symmetric representation of sigma see A237593 and its related sequences.
Equivalently, numbers k with the property that both Dyck paths of the symmetric representation of sigma(k) have an odd number of peaks. - Omar E. Pol, Sep 13 2018

Examples

			Written as an irregular triangle in which the row lengths are the odd numbers, the sequence begins:
    2;
    7,   8,   9;
   16,  17,  18,  19,  20;
   29,  30,  31,  32,  33,  34,  35;
   46,  47,  48,  49,  50,  51,  52,  53,  54;
   67,  68,  69,  70,  71,  72,  73,  74,  75,  76,  77;
   92,  93,  94,  95,  96,  97,  98,  99, 100, 101, 102, 103, 104;
  121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135;
...
Illustration of initial terms:
-----------------------------------------------------------
   k   sigma(k)   Diagram of the symmetry of sigma
-----------------------------------------------------------
                    _         _ _ _             _ _ _ _ _
                  _| |       | | | |           | | | | | |
   2      3      |_ _|       | | | |           | | | | | |
                             | | | |           | | | | | |
                            _|_| | |           | | | | | |
                          _|  _ _|_|           | | | | | |
                  _ _ _ _|  _| |               | | | | | |
   7      8      |_ _ _ _| |_ _|               | | | | | |
   8     15      |_ _ _ _ _|              _ _ _| | | | | |
   9     13      |_ _ _ _ _|             |  _ _ _|_| | | |
                                        _| |    _ _ _|_| |
                                      _|  _|   |  _ _ _ _|
                                  _ _|  _|  _ _| |
                                 |  _ _|  _|    _|
                                 | |     |     |
                  _ _ _ _ _ _ _ _| |  _ _|  _ _|
  16     31      |_ _ _ _ _ _ _ _ _| |  _ _|
  17     18      |_ _ _ _ _ _ _ _ _| | |
  18     39      |_ _ _ _ _ _ _ _ _ _| |
  19     20      |_ _ _ _ _ _ _ _ _ _| |
  20     42      |_ _ _ _ _ _ _ _ _ _ _|
.
For the first nine terms of the sequence we can see in the above diagram that both Dyck path (the smallest and the largest) of the symmetric representation of sigma(k) have a central peak.
Compare with A317304.
		

Crossrefs

Column 1 gives A130883, n >= 1.
Column 2 gives A033816, n >= 1.
Row sums give the odd-indexed terms of A006002.
Right border gives the positive terms of A014107, also the odd-indexed terms of A000096.
The union of A000217, A317304 and this sequence gives A001477.
Some other sequences related to the central peak or the central valley of the symmetric representation of sigma are A000217, A000384, A007606, A007607, A014105, A014132, A162917, A161983, A317304. See also A317306.

A317304 Numbers k with the property that both Dyck paths of the symmetric representation of sigma(k) have a central valley.

Original entry on oeis.org

4, 5, 11, 12, 13, 14, 22, 23, 24, 25, 26, 27, 37, 38, 39, 40, 41, 42, 43, 44, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149
Offset: 1

Views

Author

Omar E. Pol, Aug 27 2018

Keywords

Comments

Also triangle read by rows which gives the even-indexed rows of triangle A014132.
There are no triangular number (A000217) in this sequence.
For more information about the symmetric representation of sigma see A237593 and its related sequences.
Equivalently, numbers k with the property that both Dyck paths of the symmetric representation of sigma(k) have an even number of peaks. - Omar E. Pol, Sep 13 2018

Examples

			Written as an irregular triangle in which the row lengths are the positive even numbers, the sequence begins:
    4,   5;
   11,  12,  13,  14;
   22,  23,  24,  25,  26,  27;
   37,  38,  39,  40,  41,  42,  43,  44;
   56,  57,  58,  59,  60,  61,  62,  63,  64,  65;
   79,  80,  81,  82,  83,  84,  85,  86,  87,  88,  89,  90;
  106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119;
...
Illustration of initial terms:
-------------------------------------------------
   k  sigma(k)  Diagram of the symmetry of sigma
-------------------------------------------------
                       _ _           _ _ _ _
                      | | |         | | | | |
                     _| | |         | | | | |
                 _ _|  _|_|         | | | | |
   4      7     |_ _ _|             | | | | |
   5      6     |_ _ _|             | | | | |
                                 _ _|_| | | |
                               _|    _ _|_| |
                             _|     |  _ _ _|
                            |      _|_|
                 _ _ _ _ _ _|  _ _|
  11     12     |_ _ _ _ _ _| |  _|
  12     28     |_ _ _ _ _ _ _| |
  13     14     |_ _ _ _ _ _ _| |
  14     24     |_ _ _ _ _ _ _ _|
.
For the first six terms of the sequence we can see in the above diagram that both Dyck path (the smallest and the largest) of the symmetric representation of sigma(k) have a central valley.
Compare with A317303.
		

Crossrefs

Row sums give A084367. n >= 1.
Column 1 gives A084849, n >= 1.
Column 2 gives A096376, n >= 1.
Right border gives the nonzero terms of A014106.
The union of A000217, A317303 and this sequence gives A001477.
Some other sequences related to the central peak or the central valley of the symmetric representation of sigma are A000217, A000384, A007606, A007607, A014105, A014132, A162917, A161983, A317303. See also A317306.

A317305 Sum of divisors of the n-th number whose divisors increase by a factor of 2 or less.

Original entry on oeis.org

1, 3, 7, 12, 15, 28, 31, 39, 42, 60, 56, 72, 63, 91, 90, 96, 124, 120, 120, 168, 127, 144, 195, 186, 224, 180, 234, 252, 217, 210, 280, 248, 360, 312, 255, 336, 336, 403, 372, 392, 378, 363, 480, 372, 546, 508, 399, 468, 465, 504, 434, 576, 600, 504, 504, 560, 546, 744, 728, 511
Offset: 1

Views

Author

Omar E. Pol, Aug 25 2018

Keywords

Comments

Also consider the n-th number k with the property that the symmetric representation of sigma(k) has only one part. a(n) is the area of the diagram (see the example). For more information see A237593 and its related sequences.

Examples

			Illustration of initial terms (n = 1..13):
.
  a(n)
        _ _   _   _   _       _       _   _   _       _       _   _   _
   1   |_| | | | | | | |     | |     | | | | | |     | |     | | | | | |
   3   |_ _|_| | | | | |     | |     | | | | | |     | |     | | | | | |
        _ _|  _|_| | | |     | |     | | | | | |     | |     | | | | | |
   7   |_ _ _|    _|_| |     | |     | | | | | |     | |     | | | | | |
        _ _ _|  _|  _ _|     | |     | | | | | |     | |     | | | | | |
  12   |_ _ _ _|  _|    _ _ _| |     | | | | | |     | |     | | | | | |
        _ _ _ _| |    _|    _ _|     | | | | | |     | |     | | | | | |
  15   |_ _ _ _ _|  _|     |    _ _ _| | | | | |     | |     | | | | | |
                   |      _|   |  _ _ _|_| | | |     | |     | | | | | |
                   |  _ _|    _| |    _ _ _|_| |     | |     | | | | | |
        _ _ _ _ _ _| |      _|  _|   |  _ _ _ _|     | |     | | | | | |
  28   |_ _ _ _ _ _ _|  _ _|  _|  _ _| |    _ _ _ _ _| |     | | | | | |
                       |  _ _|  _|    _|   |    _ _ _ _|     | | | | | |
                       | |     |     |  _ _|   |    _ _ _ _ _| | | | | |
        _ _ _ _ _ _ _ _| |  _ _|  _ _|_|       |   |  _ _ _ _ _|_| | | |
  31   |_ _ _ _ _ _ _ _ _| |  _ _|  _|      _ _|   | |    _ _ _ _ _|_| |
        _ _ _ _ _ _ _ _ _| | |     |      _|    _ _| |   |  _ _ _ _ _ _|
  39   |_ _ _ _ _ _ _ _ _ _| |  _ _|    _|  _ _|  _ _|   | |
        _ _ _ _ _ _ _ _ _ _| | |       |   |    _|    _ _| |
  42   |_ _ _ _ _ _ _ _ _ _ _| |  _ _ _|  _|  _|     |  _ _|
                               | |       |  _|      _| |
                               | |  _ _ _| |      _|  _|
        _ _ _ _ _ _ _ _ _ _ _ _| | |  _ _ _|  _ _|  _|
  60   |_ _ _ _ _ _ _ _ _ _ _ _ _| | |       |  _ _|
                                   | |  _ _ _| |
                                   | | |  _ _ _|
        _ _ _ _ _ _ _ _ _ _ _ _ _ _| | | |
  56   |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _| | |
        _ _ _ _ _ _ _ _ _ _ _ _ _ _ _| | |
  72   |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _| |
        _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _| |
  63   |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
.
The length of the largest Dyck path of the n-th diagram equals A047836(n).
The semilength equals A174973(n).
a(n) is the area of the n-th diagram.
		

Crossrefs

Programs

  • Mathematica
    A317305[upto_]:=Table[If[AllTrue[Map[Last[#]/First[#]&,Partition[Divisors[n],2,1]],#<=2&],DivisorSigma[1,n],Nothing],{n,upto}];
    A317305[500] (* Paolo Xausa, Jan 12 2023 *)

Formula

a(n) = A000203(A174973(n)).

A345023 a(n) is the surface area of the symmetric tower described in A221529 which is a polycube whose successive terraces are the symmetric representation of sigma A000203(i) (from i = 1 to n) starting from the top and the levels of these terraces are the partition numbers A000041(h-1) (from h = 1 to n) starting from the base.

Original entry on oeis.org

6, 16, 32, 58, 90, 142, 202, 292, 406, 562, 754, 1034, 1370, 1822, 2410, 3176, 4136, 5402, 6982, 9026, 11598, 14838, 18894, 24034, 30396, 38312, 48136, 60288, 75220, 93624, 116104, 143598, 177090, 217770, 267106, 326820, 398804, 485472, 589644, 714564, 864000, 1042524, 1255308
Offset: 1

Views

Author

Omar E. Pol, Jun 05 2021

Keywords

Comments

The largest side of the base of the tower has length n.
The base of the tower is the symmetric representation of A024916(n).
The volume of the tower is equal to A066186(n).
The area of each lateral view of the tower is equal to A000070(n-1).
The growth of the volume of the tower represents the convolution of A000203 and A000041.
The above results are because the correspondence between divisors and partitions described in A338156 and A336812.
The tower is also a member of the family of the stepped pyramid described in A245092.
The equivalent sequence for the surface area of the stepped pyramid is A328366.

Examples

			For n = 7 we can see below some views of two associated polycubes called "prism of partitions" and "tower". Both objects contains the same number of cubes (that property is also valid for n >= 1).
     _ _ _ _ _ _ _
    |_ _ _ _      |                 7
    |_ _ _ _|_    |           4     3
    |_ _ _    |   |             5   2
    |_ _ _|_ _|_  |         3   2   2                                    _
    |_ _ _      | |               6 1                 1                 | |
    |_ _ _|_    | |         3     3 1                 1                 | |
    |_ _    |   | |           4   2 1                 1                 | |
    |_ _|_ _|_  | |       2   2   2 1                 1                _|_|
    |_ _ _    | | |             5 1 1               1 1               |   |
    |_ _ _|_  | | |         3   2 1 1               1 1              _|_ _|
    |_ _    | | | |           4 1 1 1             1 1 1             | |   |
    |_ _|_  | | | |       2   2 1 1 1             1 1 1            _|_|_ _|
    |_ _  | | | | |         3 1 1 1 1           1 1 1 1          _| |_ _ _|
    |_  | | | | | |       2 1 1 1 1 1         1 1 1 1 1      _ _|_ _|_ _ _|
    |_|_|_|_|_|_|_|     1 1 1 1 1 1 1     1 1 1 1 1 1 1     |_ _|_|_ _ _ _|
.
       Figure 1.           Figure 2.        Figure 3.           Figure 4.
   Front view of the      Partitions        Position          Lateral view
  prism of partitions.       of 7.         of the 1's.        of the tower.
.
.
                                                             _ _ _ _ _ _ _
                                                            |   | | | | |_|  1
                                                            |   | | |_|_ _|  2
                                                            |   |_|_  |_ _|  3
                                                            |_ _    |_ _ _|  4
                                                                |_  |_ _ _|  5
                                                                  |       |  6
                                                                  |_ _ _ _|  7
.
                                                               Figure 5.
                                                               Top view
                                                             of the tower.
.
Figure 1 is a two-dimensional diagram of the partitions of 7. The area of the diagram is A066186(7) = 105. Note that the diagram can be interpreted also as the front view of a right prism whose volumen is 1*7*A000041(7) = 1*7*15 = 105, equaling the volume of the tower that appears in the figures 4 and 5.
Figure 2 shows the partitions of 7 in accordance with the diagram.
Note that the shape and the area of the lateral view of the tower are the same as the shape and the area where the 1's are located in the diagram of partitions, see the figures 3 and 4. In this case the mentioned area equals A000070(7-1) = 30.
The connection between these two objects is a representation of the correspondence divisor/part described in A338156. See also A336812.
		

Crossrefs

Programs

  • Mathematica
    Accumulate @ Table[4 * PartitionsP[k-1] + 2 * DivisorSigma[1, k], {k, 1, 50}] (* Amiram Eldar, Jul 14 2021 *)

Formula

a(n) = 4*A000070(n-1) + 2*A024916(n).
a(n) = 4*A000070(n-1) + A327329(n).

A244970 Total number of regions after n-th stage in the diagram of the symmetric representation of sigma on the four quadrants.

Original entry on oeis.org

1, 2, 6, 7, 11, 12, 16, 17, 25, 29, 33, 34, 38, 42, 50, 51, 55, 56, 60, 61, 73, 77, 81, 82, 90, 94, 106, 107, 111, 112, 116, 117, 129, 133, 141, 142, 146, 150, 162, 163, 167, 168, 172, 176, 184, 188, 192, 193, 201, 209, 221, 225, 229, 230, 242, 243, 255, 259, 263, 264
Offset: 1

Views

Author

Omar E. Pol, Jul 08 2014

Keywords

Comments

Partial sums of A244971.
If we use toothpicks of length 1/2, so the area of the central square is equal to 1. The total area of the structure after n-th stage is equal to A024916(n), the sum of all divisors of all positive integers <= n, hence the total area of the n-th set of symmetric regions added at n-th stage is equal to sigma(n) = A000203(n), the sum of divisors of n.
If we use toothpicks of length 1, so the number of cells (and the area) of the central square is equal to 4. The number of cells (and the total area) of the structure after n-th stage is equal to 4*A024916(n) = A243980(n), hence the number of cells (and the total area) of the n-th set of symmetric regions added at n-th stage is equal to 4*A000203(n) = A239050(n).
a(n) is also the total number of terraces of the stepped pyramid with n levels described in A244050. - Omar E. Pol, Apr 20 2016

Examples

			Illustration of the structure after 15 stages (contains 50 regions):
.
.                   _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
.                  |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
.                  |  _ _ _ _ _ _ _ _ _ _ _ _ _ _  |
.               _ _| |_ _ _ _ _ _ _ _ _ _ _ _ _ _| |_ _
.             _|  _| |  _ _ _ _ _ _ _ _ _ _ _ _  | |_  |_
.           _|   |_ _| |_ _ _ _ _ _ _ _ _ _ _ _| |_ _|   |_
.          |  _ _|     |  _ _ _ _ _ _ _ _ _ _  |     |_ _  |
.     _ _ _|_| |      _| |_ _ _ _ _ _ _ _ _ _| |_      | |_|_ _ _
.    | |  _ _ _|    _|_ _|  _ _ _ _ _ _ _ _  |_ _|_    |_ _ _  | |
.    | | | |  _ _ _| |  _| |_ _ _ _ _ _ _ _| |_  | |_ _ _  | | | |
.    | | | | | |  _ _|_|  _|  _ _ _ _ _ _  |_  |_|_ _  | | | | | |
.    | | | | | | | |  _ _|   |_ _ _ _ _ _|   |_ _  | | | | | | | |
.    | | | | | | | | | |  _ _|  _ _ _ _  |_ _  | | | | | | | | | |
.    | | | | | | | | | | | |  _|_ _ _ _|_  | | | | | | | | | | | |
.    | | | | | | | | | | | | | |  _ _  | | | | | | | | | | | | | |
.    | | | | | | | | | | | | | | |   | | | | | | | | | | | | | | |
.    | | | | | | | | | | | | | | |_ _| | | | | | | | | | | | | | |
.    | | | | | | | | | | | | |_|_ _ _ _|_| | | | | | | | | | | | |
.    | | | | | | | | | | |_|_  |_ _ _ _|  _|_| | | | | | | | | | |
.    | | | | | | | | |_|_    |_ _ _ _ _ _|    _|_| | | | | | | | |
.    | | | | | | |_|_ _  |_  |_ _ _ _ _ _|  _|  _ _|_| | | | | | |
.    | | | | |_|_ _  | |_  |_ _ _ _ _ _ _ _|  _| |  _ _|_| | | | |
.    | | |_|_ _    |_|_ _| |_ _ _ _ _ _ _ _| |_ _|_|    _ _|_| | |
.    |_|_ _ _  |     |_  |_ _ _ _ _ _ _ _ _ _|  _|     |  _ _ _|_|
.          | |_|_      | |_ _ _ _ _ _ _ _ _ _| |      _|_| |
.          |_    |_ _  |_ _ _ _ _ _ _ _ _ _ _ _|  _ _|    _|
.            |_  |_  | |_ _ _ _ _ _ _ _ _ _ _ _| |  _|  _|
.              |_ _| |_ _ _ _ _ _ _ _ _ _ _ _ _ _| |_ _|
.                  | |_ _ _ _ _ _ _ _ _ _ _ _ _ _| |
.                  |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
.                  |_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _|
.
The diagram is also the top view of the stepped pyramid with 15 levels described in A244050. - _Omar E. Pol_, Apr 20 2016
		

Crossrefs

A272026 Triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists the numbers A016945 interleaved with k-1 zeros, and the first element of column k is in row k(k+1)/2.

Original entry on oeis.org

3, 9, 15, 3, 21, 0, 27, 9, 33, 0, 3, 39, 15, 0, 45, 0, 0, 51, 21, 9, 57, 0, 0, 3, 63, 27, 0, 0, 69, 0, 15, 0, 75, 33, 0, 0, 81, 0, 0, 9, 87, 39, 21, 0, 3, 93, 0, 0, 0, 0, 99, 45, 0, 0, 0, 105, 0, 27, 15, 0, 111, 51, 0, 0, 0, 117, 0, 0, 0, 9, 123, 57, 33, 0, 0, 3, 129, 0, 0, 21, 0, 0, 135, 63, 0, 0, 0, 0, 141, 0, 39, 0, 0, 0
Offset: 1

Views

Author

Omar E. Pol, Apr 18 2016

Keywords

Comments

Alternating sum of row n equals 3 times sigma(n), i.e., Sum_{k=1..A003056(n)} (-1)^(k-1)*T(n,k) = 3*A000203(n) = A272027(n).
Row n has length A003056(n) hence the first element of column k is in row A000217(k).
The number of positive terms in row n is A001227(n).
If T(n,k) = 9 then T(n+1,k+1) = 3 is the first element of the column k+1.
For more information see A196020.

Examples

			Triangle begins:
    3;
    9;
   15,  3;
   21,  0;
   27,  9;
   33,  0,  3;
   39, 15,  0;
   45,  0,  0;
   51, 21,  9;
   57,  0,  0,  3;
   63, 27,  0,  0;
   69,  0, 15,  0;
   75, 33,  0,  0;
   81,  0,  0,  9;
   87, 39, 21,  0,  3;
   93,  0,  0,  0,  0;
   99, 45,  0,  0,  0;
  105,  0, 27, 15,  0;
  111, 51,  0,  0,  0;
  117,  0,  0,  0,  9;
  123, 57, 33,  0,  0,  3;
  129,  0,  0, 21,  0,  0;
  135, 63,  0,  0,  0,  0;
  141,  0, 39,  0,  0,  0;
  ...
For n = 9 the divisors of 9 are 1, 3, 9, therefore the sum of the divisors of 9 is 1 + 3 + 9 = 13 and 3*13 = 39. On the other hand the 9th row of triangle is 51, 21, 9, therefore the alternating row sum is 51 - 21 + 9 = 39, equaling 3 times sigma(9).
		

Crossrefs

Formula

T(n,k) = 3*A196020(n,k) = A196020(n,k) + A236106(n,k).

A274824 Triangle read by rows: T(n,k) = (n-k+1)*sigma(k), n>=1, 1<=k<=n.

Original entry on oeis.org

1, 2, 3, 3, 6, 4, 4, 9, 8, 7, 5, 12, 12, 14, 6, 6, 15, 16, 21, 12, 12, 7, 18, 20, 28, 18, 24, 8, 8, 21, 24, 35, 24, 36, 16, 15, 9, 24, 28, 42, 30, 48, 24, 30, 13, 10, 27, 32, 49, 36, 60, 32, 45, 26, 18, 11, 30, 36, 56, 42, 72, 40, 60, 39, 36, 12, 12, 33, 40, 63, 48, 84, 48, 75, 52, 54, 24, 28, 13, 36, 44, 70, 54, 96, 56, 90, 65, 72, 36, 56, 14
Offset: 1

Views

Author

Omar E. Pol, Oct 02 2016

Keywords

Comments

Theorem: for any sequence S the partial sums of the partial sums are also the antidiagonal sums of the square array in which the n-th row gives n times the sequence S. Therefore they are also the row sums of the triangular array in which the n-th diagonal gives n times the sequence S.
In this case the sequence S is A000203.
The n-th diagonal of this triangle gives n times A000203.
The row sums give A175254 which gives the partial sums of A024916 which gives the partial sums of A000203.
T(n,k) is also the total number of unit cubes that are exactly below the terraces of the k-th level (starting from the top) up the base of the stepped pyramid with n levels described in A245092. This fact is because the mentioned terraces have the same shape as the symmetric representation of sigma(k). For more information see A237593 and A237270.
In the definition of this sequence the value n-k+1 is also the height of the terraces associated to sigma(k) in the mentioned pyramid with n levels, or in other words, the distance between the mentioned terraces and the base of the pyramid.
The sum of the n-th row of triangle equals the volume (also the number of cubes) of the mentioned pyramid with n levels.
For an illustration of the pyramid, see the Links section.
The sum of the n-th row is also 1/4 of the volume of the stepped pyramid described in A244050 with n levels.
Column k lists the positive multiples of sigma(k).
The k-th term in the n-th diagonal is equal to n*sigma(k).
Note that this is also a square array read by antidiagonals upwards: T(i,j) = i*sigma(j), i>=1, j>=1. The first row of the array is A000203. So consider that the pyramid is upside down. The value of "i" is the distance between the base of the pyramid and the terraces associated to sigma(j). The antidiagonal sums give the partial sums of the partial sums of A000203.

Examples

			Triangle begins:
1;
2,  3;
3,  6,  4;
4,  9,  8,  7;
5,  12, 12, 14, 6;
6,  15, 16, 21, 12, 12;
7,  18, 20, 28, 18, 24,  8;
8,  21, 24, 35, 24, 36,  16, 15;
9,  24, 28, 42, 30, 48,  24, 30,  13;
10, 27, 32, 49, 36, 60,  32, 45,  26,  18;
11, 30, 36, 56, 42, 72,  40, 60,  39,  36,  12;
12, 33, 40, 63, 48, 84,  48, 75,  52,  54,  24, 28;
13, 36, 44, 70, 54, 96,  56, 90,  65,  72,  36, 56,  14;
14, 39, 48, 77, 60, 108, 64, 105, 78,  90,  48, 84,  28, 24;
15, 42, 52, 84, 66, 120, 72, 120, 91,  108, 60, 112, 42, 48, 24;
16, 45, 56, 91, 72, 132, 80, 135, 104, 126, 72, 140, 56, 72, 48, 31;
...
For n = 16 and k = 10 the sum of the divisors of 10 is 1 + 2 + 5 + 10 = 18, and 16 - 10 + 1 = 7, and 7*18 = 126, so T(16,10) = 126.
On the other hand, the symmetric representation of sigma(10) has two parts of 9 cells, giving a total of 18 cells. In the stepped pyramid described in A245092, with 16 levels, there are 16 - 10 + 1 = 7 cubes exactly below every cell of the symmetric representation of sigma(10) up the base of pyramid; hence the total numbers of cubes exactly below the terraces of the 10th level (starting from the top) up the base of the pyramid is equal to 7*18 = 126. So T(16,10) = 126.
The sum of the 16th row of the triangle is 16 + 45 + 56 + 91 + 72 + 132 + 80 + 135 + 104 + 126 + 72 + 140 + 56 + 72 + 48 + 31 = A175254(16) = 1276, equaling the volume (also the number of cubes) of the stepped pyramid with 16 levels described in A245092 (see Links section).
		

Crossrefs

Row sums of triangle give A175254.
Column 1 is A000027.
Initial zeros should be omitted in the following sequences related to the columns of triangle:
Columns 2-5: A008585, A008586, A008589, A008588.
Columns 6 and 11: A008594.
Columns 7-9: A008590, A008597, A008595.
Columns 10 and 17: A008600.
Columns 12-13: A135628, A008596.
Columns 14, 15 and 23: A008606.
Columns 16 and 25: A135631.
(There are many other OEIS sequences that are also columns of this triangle.)

Formula

T(n,k) = (n-k+1) * A000203(k).
T(n,k) = A004736(n,k) * A245093(n,k).
Previous Showing 41-50 of 78 results. Next