cp's OEIS Frontend

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

If A237271(n) is odd then a(n) is even.

If A237271(n) is even then a(n) is odd.

The above sentences arise that the diagram is always symmetric for any value of n hence the number of edges is always an even number. Also from Euler's formula.

Indices of odd terms give A071561.

Indices of even terms give A071562.

For another version with subparts see A340847 from which first differs at a(6).

The parity of this sequence is also the characteristic function of numbers that have no middle divisors (cf. A348327). - Omar E. Pol, Oct 14 2021

a(n) is also the number of toothpicks of length 1 needed to represent the symmetric representation of sigma(n) (see the examples).

The diagram is symmetric thus all terms are even.

If the symmetric representation of sigma(n) has only one part (cf. A174973) or if it has two parts and they meet at the center of the Dyck path (cf. A262259) then a(n) = 4*n, otherwise a(n) < 4*n. In other words: if n is a term of A279029 then a(n) = 4*n, otherwise a(n) < 4*n.

Theorem: Indices of even terms give A028982. Indices of odd terms give A028983.

If A001227(n) is odd then a(n) is even.

If A001227(n) is even then a(n) is odd.

The above sentences arise that the diagram is always symmetric for any value of n hence the number of edges is always an even number. Also from Euler's formula.

For another version see A340833 from which first differs at a(6).

For the definition of subparts see A279387. For more information about the subparts see also A237271, A280850, A280851, A296508, A335616.

Note that in this version of the diagram of the symmetric representation of sigma(n) all regions are called "subparts". The number of subparts equals A001227(n).

Since the diagram is symmetric so all terms are even numbers.

For another version see A340846 from which first differs at a(6).

For the definition of subparts see A279387. For more information about the subparts see also A237271, A280850, A280851, A296508, A335616.

Note that in this version of the diagram of the symmetric representation of sigma(n) all regions are called "subparts". The number of subparts equals A001227(n).