A274824 -id:A274824 - cp's OEIS frontend

A237271 Number of parts in the symmetric representation of sigma(n).

1, 1, 2, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 2, 3, 1, 2, 1, 2, 1, 4, 2, 2, 1, 3, 2, 4, 1, 2, 1, 2, 1, 4, 2, 3, 1, 2, 2, 4, 1, 2, 1, 2, 2, 3, 2, 2, 1, 3, 3, 4, 2, 2, 1, 4, 1, 4, 2, 2, 1, 2, 2, 5, 1, 4, 1, 2, 2, 4, 3, 2, 1, 2, 2, 4, 2, 3, 2, 2, 1, 5, 2, 2, 1, 4, 2, 4, 1, 2, 1

Offset: 1

Omar E. Pol, Feb 25 2014

nonn

The diagram of the symmetry of sigma has been via A196020 --> A236104 --> A235791 --> A237591 --> A237593.
For more information see A237270.
a(n) is also the number of terraces at n-th level (starting from the top) of the stepped pyramid described in A245092. - Omar E. Pol, Apr 20 2016
a(n) is also the number of subparts in the first layer of the symmetric representation of sigma(n). For the definion of "subpart" see A279387. - Omar E. Pol, Dec 08 2016
Note that the number of subparts in the symmetric representation of sigma(n) equals A001227(n), the number of odd divisors of n. (See the second example). - Omar E. Pol, Dec 20 2016
From Hartmut F. W. Hoft, Dec 26 2016: (Start)
Using odd prime number 3, observe that the 1's in the 3^k-th row of the irregular triangle of A237048 are at index positions
     3^0 < 2*3^0 < 3^1 < 2*3^1 < ... < 2*3^((k-1)/2) < 3^(k/2) < ...
  the last being 2*3^((k-1)/2) when k is odd and 3^(k/2) when k is even. Since odd and even index positions alternate, each pair (3^i, 2*3^i) specifies one part in the symmetric representation with a center part present when k is even. A straightforward count establishes that the symmetric representation of 3^k, k>=0, has k+1 parts. Since this argument is valid for any odd prime, every positive integer occurs infinitely many times in the sequence. (End)
a(n) = number of runs of consecutive nonzero terms in row n of A262045. - N. J. A. Sloane, Jan 18 2021
Indices of odd terms give A071562. Indices of even terms give A071561. - Omar E. Pol, Feb 01 2021
a(n) is also the number of prisms in the three-dimensional version of the symmetric representation of k*sigma(n) where k is the height of the prisms, with k >= 1. - Omar E. Pol, Jul 01 2021
With a(1) = 0; a(n) is also the number of parts in the symmetric representation of A001065(n), the sum of aliquot parts of n. - Omar E. Pol, Aug 04 2021
The parity of this sequence is also the characteristic function of numbers that have middle divisors. - Omar E. Pol, Sep 30 2021
a(n) is also the number of polycubes in the 3D-version of the ziggurat of order n described in A347186. - Omar E. Pol, Jun 11 2024
Conjecture 1: a(n) is the number of odd divisors of n except the "e" odd divisors described in A005279. Thus a(n) is the length of the n-th row of A379288. - Omar E. Pol, Dec 21 2024
The conjecture 1 was checked up n = 10000 by Amiram Eldar. - Omar E. Pol, Dec 22 2024
The conjecture 1 is true. For a proof see A379288. - Hartmut F. W. Hoft, Jan 21 2025
From Omar E. Pol, Jul 31 2025: (Start)
Conjecture 2: a(n) is the number of 2-dense sublists of divisors of n.
We call "2-dense sublists of divisors of n" to the maximal sublists of divisors of n whose terms increase by a factor of at most 2.
In a 2-dense sublist of divisors of n the terms are in increasing order and two adjacent terms are the same two adjacent terms in the list of divisors of n.
Example: for n = 10 the list of divisors of 10 is [1, 2, 5, 10]. There are two 2-dense sublists of divisors of 10, they are [1, 2], [5, 10], so a(10) = 2.
The conjecture 2 is essentially the same as the second conjecture in the Comments of A384149. See also Peter Munn's formula in A237270.
The indices where a(n) = 1 give A174973 (2-dense numbers). See the proof there. (End)
Conjecture 3: a(n) is the number of divisors p of n such that p is greater than twice the adjacent previous divisor of n. The divisors p give the n-th row of A379288. - Omar E. Pol, Aug 02 2025

			Illustration of initial terms (n = 1..12):
---------------------------------------------------------
n   A000203  A237270    a(n)            Diagram
---------------------------------------------------------
.                               _ _ _ _ _ _ _ _ _ _ _ _
1       1      1         1     |_| | | | | | | | | | | |
2       3      3         1     |_ _|_| | | | | | | | | |
3       4      2+2       2     |_ _|  _|_| | | | | | | |
4       7      7         1     |_ _ _|    _|_| | | | | |
5       6      3+3       2     |_ _ _|  _|  _ _|_| | | |
6      12      12        1     |_ _ _ _|  _| |  _ _|_| |
7       8      4+4       2     |_ _ _ _| |_ _|_|    _ _|
8      15      15        1     |_ _ _ _ _|  _|     |
9      13      5+3+5     3     |_ _ _ _ _| |      _|
10     18      9+9       2     |_ _ _ _ _ _|  _ _|
11     12      6+6       2     |_ _ _ _ _ _| |
12     28      28        1     |_ _ _ _ _ _ _|
...
For n = 9 the sum of divisors of 9 is 1+3+9 = A000203(9) = 13. On the other hand the 9th set of symmetric regions of the diagram is formed by three regions (or parts) with 5, 3 and 5 cells, so the total number of cells is 5+3+5 = 13, equaling the sum of divisors of 9. There are three parts: [5, 3, 5], so a(9) = 3.
From _Omar E. Pol_, Dec 21 2016: (Start)
Illustration of the diagram of subparts (n = 1..12):
---------------------------------------------------------
n   A000203  A279391  A001227           Diagram
---------------------------------------------------------
.                               _ _ _ _ _ _ _ _ _ _ _ _
1       1      1         1     |_| | | | | | | | | | | |
2       3      3         1     |_ _|_| | | | | | | | | |
3       4      2+2       2     |_ _|  _|_| | | | | | | |
4       7      7         1     |_ _ _|  _ _|_| | | | | |
5       6      3+3       2     |_ _ _| |_|  _ _|_| | | |
6      12      11+1      2     |_ _ _ _|  _| |  _ _|_| |
7       8      4+4       2     |_ _ _ _| |_ _|_|  _ _ _|
8      15      15        1     |_ _ _ _ _|  _|  _| |
9      13      5+3+5     3     |_ _ _ _ _| |  _|  _|
10     18      9+9       2     |_ _ _ _ _ _| |_ _|
11     12      6+6       2     |_ _ _ _ _ _| |
12     28      23+5      2     |_ _ _ _ _ _ _|
...
For n = 6 the symmetric representation of sigma(6) has two subparts: [11, 1], so A000203(6) = 12 and A001227(6) = 2.
For n = 12 the symmetric representation of sigma(12) has two subparts: [23, 5], so A000203(12) = 28 and A001227(12) = 2. (End)
From _Hartmut F. W. Hoft_, Dec 26 2016: (Start)
Two examples of the general argument in the Comments section:
Rows 27 in A237048 and A249223 (4 parts)
i:  1  2 3 4 5 6 7 8 9 . . 12
27: 1  1 1 0 0 1                           1's in A237048 for odd divisors
    1 27 3     9                           odd divisors represented
27: 1  0 1 1 1 0 0 1 1 1 0 1               blocks forming parts in A249223
Rows 81 in A237048 and A249223 (5 parts)
i:  1  2 3 4 5 6 7 8 9 . . 12. . . 16. . . 20. . . 24
81: 1  1 1 0 0 1 0 0 1 0 0 0                          1's in A237048 f.o.d
    1 81 3    27     9                                odd div. represented
81: 1  0 1 1 1 0 0 0 1 1 1 1 1 1 1 1 0 0 0 1 1 1 0 1  blocks fp in A249223
(End)

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..5000 from Michel Marcus)

Row lengths of A237270 and of A379288.
Column 1 of A279387.
Partial sums give A237590.
Parity gives A347950.
Cf. A000203, A000265, A001065, A001227, A005279, A024916, A060831, A061345, A067742, A071561, A071562, A175254, A196020, A221529, A235791, A236104, A237048, A237591, A237593, A239657, A244050, A244971, A245092, A249223, A250068, A261699, A262045, A262612, A262626, A274824, A279387, A279693, A319073, A340583, A340846, A342344, A347186, A379288.
Cf. A027750, A174973 (2-dense numbers), A239663, A240062, A243982, A379379, A380580, A384149, A384222, A384225, A384226, A384230, A384930.

a237271[n_] := Length[a237270[n]] (* code defined in A237270 *)
Map[a237271, Range[90]] (* data *)
(* Hartmut F. W. Hoft, Jun 23 2014 *)
a[n_] := Module[{d = Partition[Divisors[n], 2, 1]}, 1 + Count[d, ?(OddQ[#[[2]]] && #[[2]] >= 2*#[[1]] &)]]; Array[a, 100] (* _Amiram Eldar,  Dec 22 2024 *)

fill(vcells, hga, hgb) = {ic = 1; for (i=1, #hgb, if (hga[i] < hgb[i], for (j=hga[i], hgb[i]-1, cell = vector(4); cell[1] = i - 1; cell[2] = j; vcells[ic] = cell; ic ++;););); vcells;}
findfree(vcells) = {for (i=1, #vcells, vcelli = vcells[i]; if ((vcelli[3] == 0) && (vcelli[4] == 0), return (i));); return (0);}
findxy(vcells, x, y) = {for (i=1, #vcells, vcelli = vcells[i]; if ((vcelli[1]==x) && (vcelli[2]==y) && (vcelli[3] == 0) && (vcelli[4] == 0), return (i));); return (0);}
findtodo(vcells, iz) = {for (i=1, #vcells, vcelli = vcells[i]; if ((vcelli[3] == iz) && (vcelli[4] == 0), return (i)); ); return (0);}
zcount(vcells) = {nbz = 0; for (i=1, #vcells, nbz = max(nbz, vcells[i][3]);); nbz;}
docell(vcells, ic, iz) = {x = vcells[ic][1]; y = vcells[ic][2]; if (icdo = findxy(vcells, x-1, y), vcells[icdo][3] = iz); if (icdo = findxy(vcells, x+1, y), vcells[icdo][3] = iz); if (icdo = findxy(vcells, x, y-1), vcells[icdo][3] = iz); if (icdo = findxy(vcells, x, y+1), vcells[icdo][3] = iz); vcells[ic][4] = 1; vcells;}
docells(vcells, ic, iz) = {vcells[ic][3] = iz; while (ic, vcells = docell(vcells, ic, iz); ic = findtodo(vcells, iz);); vcells;}
nbzb(n, hga, hgb) = {vcells = vector(sigma(n)); vcells = fill(vcells, hga, hgb); iz = 1; while (ic = findfree(vcells), vcells = docells(vcells, ic, iz); iz++;); zcount(vcells);}
lista(nn) = {hga = concat(heights(row237593(0), 0), 0); for (n=1, nn, hgb = heights(row237593(n), n); nbz = nbzb(n, hga, hgb); print1(nbz, ", "); hga = concat(hgb, 0););} \\ with heights() also defined in A237593; \\ Michel Marcus, Mar 28 2014

from sympy import divisors
def a(n: int) -> int:
    divs = list(divisors(n))
    d = [divs[i:i+2] for i in range(len(divs) - 1)]
    s = sum(1 for pair in d if len(pair) == 2 and pair[1] % 2 == 1 and pair[1] >= 2 * pair[0])
    return s + 1
print([a(n) for n in range(1, 80)])  # Peter Luschny, Aug 05 2025

a(n) = A001227(n) - A239657(n). - Omar E. Pol, Mar 23 2014
a(p^k) = k + 1, where p is an odd prime and k >= 0. - Hartmut F. W. Hoft, Dec 26 2016
Theorem: a(n) <= number of odd divisors of n (cf. A001227). The differences are in A239657. - N. J. A. Sloane, Jan 19 2021
a(n) = A340846(n) - A340833(n) + 1 (Euler's formula). - Omar E. Pol, Feb 01 2021
a(n) = A000005(n) - A243982(n). - Omar E. Pol, Aug 02 2025

A175254 a(n) = Sum_{k<=n} A000203(k)*(n-k+1), where A000203(m) is the sum of divisors of m.

Original entry on oeis.org

1, 5, 13, 28, 49, 82, 123, 179, 248, 335, 434, 561, 702, 867, 1056, 1276, 1514, 1791, 2088, 2427, 2798, 3205, 3636, 4127, 4649, 5213, 5817, 6477, 7167, 7929, 8723, 9580, 10485, 11444, 12451, 13549, 14685, 15881, 17133, 18475, 19859, 21339, 22863, 24471, 26157

Offset: 1

Jaroslav Krizek, Mar 14 2010

Partial sums of A024916. - Omar E. Pol, Jul 03 2014
a(n) is also the volume of the stepped pyramid with n levels described in A245092. - Omar E. Pol, Aug 12 2015
Also the alternating row sums of A262612. - Omar E. Pol, Nov 23 2015
From Omar E. Pol, Jan 20 2021: (Start)
Convolution of A000203 and A000027.
Convolution of A340793 and the nonzero terms of A000217.
Antidiagonal sums of A319073.
Row sums of A274824. (End)
Row sums of A345272. - Omar E. Pol, Jun 14 2021
Also the alternating row sums of A353690. - Omar E. Pol, Jun 05 2022

			For n = 4: a(4) = sigma(1)*4 + sigma(2)*3 + sigma(3)*2 + sigma(4)*1 = 1*4 + 3*3 + 4*2 + 7*1 = 28.

Alois P. Heinz, Table of n, a(n) for n = 1..10000 (first 2209 terms from Indranil Ghosh)

Cf. A000203, A000217, A006218, A024916, A072481, A237593, A244050, A245092, A262612, A274824, A319073, A340793, A345272, A353690.

Cf. A143128, A353908.

b:= proc(n) option remember; `if`(n<1, [0$2],
      (p-> p+[numtheory[sigma](n), p[1]])(b(n-1)))
    end:
a:= n-> b(n+1)[2]:
seq(a(n), n=1..45);  # Alois P. Heinz, Oct 07 2021

Table[Sum[DivisorSigma[1, k] (n - k + 1), {k, n}], {n, 45}] (* Michael De Vlieger, Nov 24 2015 *)

a(n) = sum(x=1, n, sigma(x)*(n-x+1)) \\ Michel Marcus, Mar 18 2013

from math import isqrt
def A175254(n): return (((s:=isqrt(n))**2*(s+1)*((s+1)*(2*s+1)-6*(n+1))>>1) + sum((q:=n//k)*(-k*(q+1)*(3*k+2*q+1)+3*(n+1)*(2*k+q+1)) for k in range(1,s+1)))//6 # Chai Wah Wu, Oct 21 2023

Conjecture: a(n) = Sum_{k=0..n} A006218(n-k). - R. J. Mathar, Oct 17 2012
a(n) = A000330(n) - A072481(n). - Omar E. Pol, Aug 12 2015
a(n) ~ Pi^2*n^3/36. - Vaclav Kotesovec, Sep 25 2016
G.f.: (1/(1 - x)^2)*Sum_{k>=1} k*x^k/(1 - x^k). - Ilya Gutkovskiy, Jan 03 2017
a(n) = Sum_{k=1..n} Sum_{i=1..k} k - (k mod i). - Wesley Ivan Hurt, Sep 13 2017
a(n) = A244050(n)/4. - Omar E. Pol, Jan 22 2021
a(n) = (n+1)*A024916(n) - A143128(n). - Vaclav Kotesovec, May 11 2022

Corrected by Jaroslav Krizek, Mar 17 2010

More terms from Michel Marcus, Mar 18 2013

A272214 Square array read by antidiagonals upwards in which T(n,k) is the product of the n-th prime and the sum of the divisors of k, n >= 1, k >= 1.

Original entry on oeis.org

2, 3, 6, 5, 9, 8, 7, 15, 12, 14, 11, 21, 20, 21, 12, 13, 33, 28, 35, 18, 24, 17, 39, 44, 49, 30, 36, 16, 19, 51, 52, 77, 42, 60, 24, 30, 23, 57, 68, 91, 66, 84, 40, 45, 26, 29, 69, 76, 119, 78, 132, 56, 75, 39, 36, 31, 87, 92, 133, 102, 156, 88, 105, 65, 54, 24, 37, 93, 116, 161, 114, 204, 104, 165, 91, 90, 36, 56

Offset: 1

Omar E. Pol, Apr 28 2016

From Omar E. Pol, Dec 21 2021: (Start)
Also triangle read by rows: T(n,j) = A000040(n-j+1)*A000203(j), 1 <= j <= n.
For a visualization of T(n,j) first consider a tower (a polycube) in which the terraces are the symmetric representation of sigma(j), for j = 1 to n, starting from the top, and the heights of the terraces are the first n prime numbers respectively starting from the base. Then T(n,j) can be represented with a set of A237271(j) right prisms of height A000040(n-j+1) since T(n,j) is also the total number of cubes that are exactly below the parts of the symmetric representation of sigma(j) in the tower.
The sum of the n-th row of triangle is A086718(n) equaling the volume of the tower whose largest side of the base is n and its total height is the n-th prime.
The tower is an member of the family of the stepped pyramids described in A245092 and of the towers described in A221529. That is an infinite family of symmetric polycubes whose volumes represent the convolution of A000203 with any other integer sequence. (End)

			The corner of the square array begins:
   2,  6,   8,  14,  12,  24,  16,  30,  26,  36, ...
   3,  9,  12,  21,  18,  36,  24,  45,  39,  54, ...
   5, 15,  20,  35,  30,  60,  40,  75,  65,  90, ...
   7, 21,  28,  49,  42,  84,  56, 105,  91, 126, ...
  11, 33,  44,  77,  66, 132,  88, 165, 143, 198, ...
  13, 39,  52,  91,  78, 156, 104, 195, 169, 234, ...
  17, 51,  68, 119, 102, 204, 136, 255, 221, 306, ...
  19, 57,  76, 133, 114, 228, 152, 285, 247, 342, ...
  23, 69,  92, 161, 138, 276, 184, 345, 299, 414, ...
  29, 87, 116, 203, 174, 348, 232, 435, 377, 522, ...
  ...
From _Omar E. Pol_, Dec 21 2021: (Start)
Written as a triangle the sequence begins:
   2;
   3,  6;
   5,  9,  8;
   7, 15, 12,  14;
  11, 21, 20,  21,  12;
  13, 33, 28,  35,  18,  24;
  17, 39, 44,  49,  30,  36, 16;
  19, 51, 52,  77,  42,  60, 24,  30;
  23, 57, 68,  91,  66,  84, 40,  45, 26;
  29, 69, 76, 119,  78, 132, 56,  75, 39, 36;
  31, 87, 92, 133, 102, 156, 88, 105, 65, 54, 24;
...
Row sums give A086718. (End)

Ivan Neretin, Table of n, a(n) for n = 1..8128

Rows 1-4 of the square array: A074400, A272027, A274535, A319527.
Columns 1-5 of the square array: A000040, A001748, A001749, A138636, A272470.
Main diagonal of the square array gives A272211.
Cf. A086718 (antidiagonal sums of the square array, row sums of the triangle).
Cf. A000203, A221529, A237270, A237271, A237593, A245092, A272173, A272400, A274824.

Table[Prime[#] DivisorSigma[1, k] &@(n - k + 1), {n, 12}, {k, n}] // Flatten (* Michael De Vlieger, Apr 28 2016 *)

T(n,k) = prime(n)*sigma(k) = A000040(n)*A000203(k), n >= 1, k >= 1.

T(n,k) = A272400(n+1,k).

A319073 Square array read by antidiagonals upwards: T(n,k) = k*sigma(n), n >= 1, k >= 1.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Sep 22 2018

			The corner of the square array begins:
         A000203 A074400 A272027 A239050 A274535 A274536 A319527 A319528
A000027:       1,      2,      3,      4,      5,      6,      7,      8, ...
A008585:       3,      6,      9,     12,     15,     18,     21,     24, ...
A008586:       4,      8,     12,     16,     20,     24,     28,     32, ...
A008589:       7,     14,     21,     28,     35,     42,     49,     56, ...
A008588:       6,     12,     18,     24,     30,     36,     42,     48, ...
A008594:      12,     24,     36,     48,     60,     72,     84,     96, ...
A008590:       8,     16,     24,     32,     40,     48,     56,     64, ...
A008597:      15,     30,     45,     60,     75,     90,    105,    120, ...
A008595:      13,     26,     39,     52,     65,     78,     91,    104, ...
A008600:      18,     36,     54,     72,     90,    108,    126,    144, ...
...

Index entries for sequences related to sigma(n)

Another version of A274824.
Antidiagonal sums give A175254.
Main diagonal gives A064987.
Row n lists the multiples of A000203(n).
Row 1 is A000027.
Initial zeros should be omitted in the following sequences related to the rows of the array:
Row 2-5: A008585, A008586, A008589, A008588.
Rows 6 and 11: A008594.
Rows 7-9: A008590, A008597, A008595.
Rows 10 and 17: A008600.
Rows 12-13: A135628, A008596.
Rows 14, 15 and 23: A008606.
Rows 16 and 25: A135631.
(Note that in the OEIS there are many other sequences that are also rows of this square array.)
Cf. A000203, A237593, A319526.

T:=Flat(List([1..12],n->List([1..n],k->k*Sigma(n-k+1))));; Print(T); # Muniru A Asiru, Jan 01 2019

with(numtheory): T:=(n,k)->k*sigma(n-k+1): seq(seq(T(n,k),k=1..n),n=1..12); # Muniru A Asiru, Jan 01 2019

Table[k DivisorSigma[1, #] &[m - k + 1], {m, 12}, {k, m}] // Flatten (* Michael De Vlieger, Dec 31 2018 *)

cp's OEIS Frontend

A237271 Number of parts in the symmetric representation of sigma(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A175254 a(n) = Sum_{k<=n} A000203(k)*(n-k+1), where A000203(m) is the sum of divisors of m.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

Extensions

A272214 Square array read by antidiagonals upwards in which T(n,k) is the product of the n-th prime and the sum of the divisors of k, n >= 1, k >= 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A319073 Square array read by antidiagonals upwards: T(n,k) = k*sigma(n), n >= 1, k >= 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

GAP

Maple

Mathematica