A386989 -id:A386989 - cp's OEIS frontend

A384222 Irregular triangle read by rows: T(n,k) is the length of the k-th 2-dense sublist of divisors of n, with n >= 1, k >= 1.

1, 2, 1, 1, 3, 1, 1, 4, 1, 1, 4, 1, 1, 1, 2, 2, 1, 1, 6, 1, 1, 2, 2, 1, 2, 1, 5, 1, 1, 6, 1, 1, 6, 1, 1, 1, 1, 2, 2, 1, 1, 8, 1, 1, 1, 2, 2, 1, 1, 1, 1, 6, 1, 1, 8, 1, 1, 6, 1, 1, 1, 1, 2, 2, 1, 2, 1, 9, 1, 1, 2, 2, 1, 1, 1, 1, 8, 1, 1, 8, 1, 1, 3, 3, 1, 4, 1, 2, 2, 1, 1, 10, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 3, 3, 1, 1, 8

Offset: 1

Omar E. Pol, Jun 03 2025

The 2-dense sublists of divisors of n are the maximal sublists whose terms increase by a factor of at most 2.
In a 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.
Row n has only one term, which is A000005(n), if and only if n is in A174973.
Conjecture 1: row n is a palindromic composition of A000005(n).
If the conjecture is true then this triangle should be a companion of A237270 in the sense that here the n-th row should be a palindromic composition of sigma_0(n) = A000005(n) and the n-th row of A237270 is a palindromic composition of sigma_1(n) = A000203(n).
A384149(n,k) is the sum of the terms in the k-th sublist of divisors of n. In the comments of A384149 it is conjectured that the row lengths of that triangle give A237271. If that conjecture is true then here the row lengths should also be A237271 and therefore A237271(n) could be defined also as the number of 2-dense sublists of divisors of n.

			  ----------------------------------------------------------------
  |  n | Row n of     |  List of divisors of n       | Number of |
  |    | the triangle |  [with sublists in brackets] | sublists  |
  ----------------------------------------------------------------
  |  1 |  1;          |  [1];                        |     1     |
  |  2 |  2;          |  [1, 2];                     |     1     |
  |  3 |  1, 1;       |  [1], [3];                   |     2     |
  |  4 |  3;          |  [1, 2, 4];                  |     1     |
  |  5 |  1, 1;       |  [1], [5];                   |     2     |
  |  6 |  4;          |  [1, 2, 3, 6];               |     1     |
  |  7 |  1, 1;       |  [1], [7];                   |     2     |
  |  8 |  4;          |  [1, 2, 4, 8];               |     1     |
  |  9 |  1, 1, 1;    |  [1], [3], [9];              |     3     |
  | 10 |  2, 2;       |  [1, 2], [5, 10];            |     2     |
  | 11 |  1, 1;       |  [1], [11];                  |     2     |
  | 12 |  6;          |  [1, 2, 3, 4, 6, 12];        |     1     |
  | 13 |  1, 1;       |  [1], [13];                  |     2     |
  | 14 |  2, 2;       |  [1, 2], [7, 14];            |     2     |
  | 15 |  1, 2, 1;    |  [1], [3, 5], [15];          |     3     |
  | 16 |  5;          |  [1, 2, 4, 8, 16];           |     1     |
  | 17 |  1, 1;       |  [1], [17];                  |     2     |
  | 18 |  6;          |  [1, 2, 3, 6, 9, 18];        |     1     |
  | 19 |  1, 1;       |  [1], [19];                  |     2     |
  | 20 |  6;          |  [1, 2, 4, 5, 10, 20];       |     1     |
  | 21 |  1, 1, 1, 1; |  [1], [3], [7], [21];        |     4     |
  | 22 |  2, 2;       |  [1, 2], [11, 22];           |     2     |
  | 23 |  1, 1;       |  [1], [23];                  |     2     |
  | 24 |  8;          |  [1, 2, 3, 4, 6, 8, 12, 24]; |     1     |
   ...
  ...
For n = 14 the list of divisors of 14 is [1, 2, 7, 14]. There are two sublists of divisors of 14 whose terms increase by a factor of at most 2, they are [1, 2] and [7, 14]. Each sublist has two terms, so the row 14 is [2, 2].
For n = 15 the list of divisors of 15 is [1, 3, 5, 15]. There are three sublists of divisors of 15 whose terms increase by a factor of at most 2, they are [1], [3, 5], [15]. The number of terms in the sublists are [1, 2, 1] respectively, so the row 15 is [1, 2, 1].
78 is the first practical number A005153 not in A174973. For n = 78 the list of divisors of 78 is [1, 2, 3, 6, 13, 26, 39, 78]. There are two sublists of divisors of 78 whose terms increase by a factor of at most 2, they are [1, 2, 3, 6] and [13, 26, 39, 78]. The number of terms in the sublists are [4, 4] respectively, so the row 78 is [4, 4].
From _Omar E. Pol_, Jul 23 2025: (Start)
A visualization with symmetries of the list of divisors of the first 24 positive integers and the sublists of divisors is as shown below:
  ---------------------------------------------------------------------------------
  |     n     |                 List of divisors of n                 | Number of |
  |           |        [with sublists of divisors in brackets]        | sublists  |
  ---------------------------------------------------------------------------------
  |     1     |                          [1]                          |     1     |
  |     2     |                         [1 2]                         |     1     |
  |     3     |                        [1] [3]                        |     2     |
  |     4     |                       [1  2  4]                       |     1     |
  |     5     |                      [1]     [5]                      |     2     |
  |     6     |                     [1   2 3   6]                     |     1     |
  |     7     |                    [1]         [7]                    |     2     |
  |     8     |                   [1    2   4    8]                   |     1     |
  |     9     |                  [1]     [3]     [9]                  |     3     |
  |    10     |                 [1     2]   [5    10]                 |     2     |
  |    11     |                [1]                [11]                |     2     |
  |    12     |               [1      2  3 4  6     12]               |     1     |
  |    13     |              [1]                    [13]              |     2     |
  |    14     |             [1       2]       [7      14]             |     2     |
  |    15     |            [1]         [3   5]        [15]            |     3     |
  |    16     |           [1        2     4     8       16]           |     1     |
  |    17     |          [1]                            [17]          |     2     |
  |    18     |         [1         2   3     6   9        18]         |     1     |
  |    19     |        [1]                                [19]        |     2     |
  |    20     |       [1          2      4 5     10         20]       |     1     |
  |    21     |      [1]             [3]     [7]            [21]      |     4     |
  |    22     |     [1           2]              [11          22]     |     2     |
  |    23     |    [1]                                        [23]    |     2     |
  |    24     |   [1            2    3  4   6  8   12           24]   |     1     |
       ...
A similar structure show the positive integers in the square array A385000. (End)

Paolo Xausa, Table of n, a(n) for n = 1..10607 (rows 1..3500 of triangle, flattened).

Row sums give A000005.

Cf. A000203, A005153, A027750, A174973 (2-dense numbers), A237271, A379288, A384149, A384225, A384226, A384928, A384930, A384931, A385000, A386984, A386989, A387030.

A384222row[n_] := Map[Length, Split[Divisors[n], #2/# <= 2 &]];
Array[A384222row, 50] (* Paolo Xausa, Jul 08 2025 *)

A384225 Irregular triangle read by rows: T(n,k) is the number of odd divisors in the k-th 2-dense sublist of divisors of n, with n >= 1, k >= 1.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Jun 16 2025

T(n,k) is the number of odd numbers in the k-th sublist of divisors of n whose terms increase by a factor of at most 2,
In a 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.
At least for the first 1000 rows the row lengths give A237271.
Observation: at least the first 33 rows (or first 62 terms) coincide with A280940.

			  ------------------------------------------------------------------
  |  n | Row n of       |  List of divisors of n       | Number of |
  |    | the triangle   |  [with sublists in brackets] | sublists  |
  ------------------------------------------------------------------
  |  1 |   1;           |  [1];                        |     1     |
  |  2 |   1;           |  [1, 2];                     |     1     |
  |  3 |   1, 1;        |  [1], [3];                   |     2     |
  |  4 |   1;           |  [1, 2, 4];                  |     1     |
  |  5 |   1, 1;        |  [1], [5];                   |     2     |
  |  6 |   2;           |  [1, 2, 3, 6];               |     1     |
  |  7 |   1, 1;        |  [1], [7];                   |     2     |
  |  8 |   1;           |  [1, 2, 4, 8];               |     1     |
  |  9 |   1, 1, 1;     |  [1], [3], [9];              |     3     |
  | 10 |   1, 1;        |  [1, 2], [5, 10];            |     2     |
  | 11 |   1, 1;        |  [1], [11];                  |     2     |
  | 12 |   2;           |  [1, 2, 3, 4, 6, 12];        |     1     |
  | 13 |   1, 1;        |  [1], [13];                  |     2     |
  | 14 |   1, 1;        |  [1, 2], [7, 14];            |     2     |
  | 15 |   1, 2, 1;     |  [1], [3, 5], [15];          |     3     |
  | 16 |   1;           |  [1, 2, 4, 8, 16];           |     1     |
  | 17 |   1, 1;        |  [1], [17];                  |     2     |
  | 18 |   3;           |  [1, 2, 3, 6, 9, 18];        |     1     |
  | 19 |   1, 1;        |  [1], [19];                  |     2     |
  | 20 |   2;           |  [1, 2, 4, 5, 10, 20];       |     1     |
  | 21 |   1, 1, 1, 1;  |  [1], [3], [7], [21];        |     4     |
   ...
For n = 14 the list of divisors of 14 is [1, 2, 7, 14]. There are two sublists of divisors of 14 whose terms increase by a factor of at most 2, they are [1, 2] and [7, 14]. Each sublist has only one odd number, so the row 14 is [1, 1].
For n = 15 the list of divisors of 15 is [1, 3, 5, 15]. There are three sublists of divisors of 15 whose terms increase by a factor of at most 2, they are [1], [3, 5], [15]. The number of odd numbers in the sublists are [1, 2, 1] respectively, so the row 15 is [1, 2, 1].
For n = 16 the list of divisors of 16 is [1, 2, 4, 8, 16]. There is only one sublist of divisors of 16 whose terms increase by a factor of at most 2, that is the same as the list of divisors of 16, which has five terms and only one odd number, so the row 16 is [1].

Paolo Xausa, Table of n, a(n) for n = 1..10607 (rows 1..3500 of triangle, flattened).

Row sums give A001227.

Cf. A000203, A027750, A174973 (2-dense numbers), A280940, A237271, A379288, A384149, A384222, A384226, A384928, A384930, A384931, A385000, A386984, A386989, A387030.

A384225row[n_] := Map[Count[#, _?OddQ] &, Split[Divisors[n], #2/# <= 2 &]];
Array[A384225row, 50] (* Paolo Xausa, Jul 08 2025 *)

A384928 Number of 2-dense sublists of divisors of the n-th triangular number.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 4, 1, 1, 3, 4, 1, 2, 3, 4, 1, 2, 5, 6, 3, 1, 5, 4, 1, 1, 5, 6, 1, 4, 5, 6, 1, 1, 5, 6, 1, 2, 3, 6, 1, 2, 7, 8, 3, 1, 3, 4, 1, 1, 5, 6, 3, 4, 7, 3, 1, 1, 5, 4, 1, 2, 3, 8, 1, 1, 7, 8, 3, 3, 5, 6, 1, 2, 3, 6, 1, 4, 5, 8, 1, 1, 7, 4, 1, 1, 7, 6, 1, 4, 5, 3, 3, 3, 5, 8, 1, 2, 5, 5, 1, 6

Offset: 0

Omar E. Pol, Aug 08 2025

nonn

By definition a(n) is also the number of 2-dense sublists of divisors of the n-th generalized hexagonal number.
In a sublist of divisors of k the terms are in increasing order and two adjacent terms are the same two adjacent terms in the list of divisors of k.
The 2-dense sublists of divisors of k are the maximal sublists whose terms increase by a factor of at most 2.
Conjecture: all odd indexed terms are odd.

			For n = 5 the 5th triangular number is 15. The list of divisors of 15 is [1, 3, 5, 15]. There are three 2-dense sublists of divisors of 15, they are [1], [3, 5], [15], so a(5) = 3.
For n = 12 the 12th triangular number is 78. The list of divisors of 78 is [1, 2, 3, 6, 13, 26, 39, 78]. There are two 2-dense sublists of divisors of 78, they are [1, 2, 3, 6] and [13, 26, 39, 78], so a(12) = 2. Note that 78 is also the first practical number A005153 not in the sequence of the 2-dense numbers A174973.

Alois P. Heinz, Table of n, a(n) for n = 0..10000

Cf. A000217, A005153, A174973 (2-dense numbers), A237271, A379288, A384149, A384222, A384225, A384226, A384930, A384931, A386984 (a bisection), A386989.

A384928[n_] := Length[Split[Divisors[PolygonalNumber[n]], #2 <= 2*# &]];
Array[A384928, 100, 0] (* Paolo Xausa, Aug 14 2025 *)

a(n) = A237271(A000217(n)) for n >= 1 (conjectured).

A386984 Number of 2-dense sublists of divisors of the n-th hexagonal number.

Original entry on oeis.org

1, 1, 1, 3, 1, 3, 1, 3, 1, 5, 3, 5, 1, 5, 1, 5, 1, 5, 1, 3, 1, 7, 3, 3, 1, 5, 3, 7, 1, 5, 1, 3, 1, 7, 3, 5, 1, 3, 1, 5, 1, 7, 1, 7, 1, 5, 3, 5, 1, 5, 1, 7, 3, 5, 1, 7, 1, 7, 5, 7, 1, 5, 3, 3, 1, 7, 1, 7, 1, 7, 5, 5, 1, 7, 1, 7, 3, 5, 1, 3, 1, 9, 3, 7, 1, 7, 1, 7, 1, 5, 1, 5, 1, 9, 3, 3, 1, 3, 1, 9, 1

Offset: 0

Omar E. Pol, Aug 11 2025

In a sublist of divisors of k the terms are in increasing order and two adjacent terms are the same two adjacent terms in the list of divisors of k.
The 2-dense sublists of divisors of k are the maximal sublists whose terms increase by a factor of at most 2.
Conjecture: all terms are odd.

			For n = 3 the third positive hexagonal number is 15. The list of divisors of 15 is [1, 3, 5, 15]. There are three 2-dense sublists of divisors of 15, they are [1], [3, 5], [15], so a(3) = 3.

Paolo Xausa, Table of n, a(n) for n = 0..10000

Bisection of A384928.

Cf. A000384, A174973 (2-dense numbers), A237271, A379288, A384149, A384222, A384225, A384226, A384930, A384931, A386989.

A386984[n_] := Length[Split[Divisors[PolygonalNumber[6, n]], #2 <= 2*# &]];
Array[A386984, 100, 0] (* Paolo Xausa, Aug 29 2025 *)

a(n) = A237271(A000384(n)) for n >= 1 (conjectured).

cp's OEIS Frontend

A384222 Irregular triangle read by rows: T(n,k) is the length of the k-th 2-dense sublist of divisors of n, with n >= 1, k >= 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A384225 Irregular triangle read by rows: T(n,k) is the number of odd divisors in the k-th 2-dense sublist of divisors of n, with n >= 1, k >= 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A384928 Number of 2-dense sublists of divisors of the n-th triangular number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A386984 Number of 2-dense sublists of divisors of the n-th hexagonal number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula