A174973 -id:A174973 - cp's OEIS frontend

A262259 Numbers k such that the symmetric representation of sigma(k) has only two parts and they meet at the center of the Dyck path.

3, 10, 78, 136, 666, 820, 1830, 2628, 4656, 5886, 6328, 16290, 18528, 28920, 32896, 39340, 48828, 56616, 62128, 78606, 80200, 83436, 88410, 93528, 100576, 104196, 135460, 146070, 166176, 180300, 187578, 190036

Offset: 1

Hartmut F. W. Hoft, Sep 16 2015

For a proof of the formula see the link and also the links in A239929 and A071561. This formula allows for a fast computation of numbers in the sequence that does not require computations of Dyck paths.
Subsequence of A239929.
A191363 is a subsequence.
All terms are triangular numbers.
More precisely, all terms are second hexagonal numbers (A014105). There are no terms with middle divisors. - Omar E. Pol, Oct 31 2018
Numbers k such that the concatenation of the widths of the symmetric representation of sigma(k) is a cyclops numbers (A134808). - Omar E. Pol, Aug 29 2021

			q = 128 = 2^7 is the 15th term in A174973 for which 2*n+1 = 2^8 + 1 is prime so that a(15) = 2^7 * (2^8 + 1) = 32896. The two parts in the symmetric representation of sigma of a(15) have width 1 and sigma(a(15)) = 2 * a(15) - 2.
q = 308 is the 32nd term in A174973 for which 2*n+1 is prime so that a(32) = 308 * 617 = 190036. The maximum width of the two regions is 2 and sigma(a(32)) = 415296.
For n = 21, the symmetric representation of sigma(21) has two parts that meet at the center of the Dyck path, but 21 is not in the sequence because the symmetric representation of sigma(21) has more than two parts. - _Omar E. Pol_, Sep 18 2015
From _Omar E. Pol_, Oct 05 2015: (Start)
Illustration of initial terms (n = 1, 2):
. y
.  |
.  |_ _ _ _ _ _
.  |_ _ _ _ _  |
.  |         | |_
.  |         |_ _|_
.  |             | |_ _
.  |             |_ _  |
.  |                 | |
.  |_ _              | |
.  |_ _|_            | |
.  |   | |           | |
.  |_ _|_|_ _ _ _ _ _|_|_ _ x
.       3             10
.
The symmetric representation of sigma(3) = 2 + 2 = 4 has two parts and they meet at the point (2, 2), so a(1) = 3.
The symmetric representation of sigma(10) = 9 + 9 = 18 has two parts and they meet at the point (7, 7), so a(2) = 10.
(End)
Also 10 is in the sequence because the concatenation of the widths of the symmetric representation of sigma(10) is 1111111110111111111 and it is a cyclops number (A134808). - _Omar E. Pol_, Aug 29 2021

Hartmut F. W. Hoft, proof of formula

Cf. A000203, A000217, A014105, A071561, A134808, A174973, A191363, A235791, A236104, A237048, A237270, A237271, A237591, A237593, A239929, A245092, A249351 (widths), A262045, A262048, A262626.

(* test for membership in A174973 *)
a174973Q[n_]:=Module[{d=Divisors[n]}, Select[Rest[d] - 2 Most[d], #>0&]=={}]
a174973[n_]:=Select[Range[n], a174973Q]
(* compute numbers in the sequence *)
a262259[n_]:=Map[#(2#+1)&, Select[a174973[1, n], PrimeQ[2#+1]&]]
a262259[308] (* data *)

Terms are equal to q*(2*q + 1) where q is in A174973 and 2*q + 1 is prime.

A279102 Numbers n having three parts in the symmetric representation of sigma(n).

Original entry on oeis.org

9, 15, 25, 35, 45, 49, 50, 70, 77, 91, 98, 110, 121, 130, 135, 143, 154, 169, 170, 182, 187, 190, 209, 221, 225, 238, 242, 247, 266, 286, 289, 299, 315, 322, 323, 338, 350, 361, 374, 391, 405, 418, 437, 442, 484, 493, 494, 506, 527, 529, 550, 551, 572, 578, 589, 598, 638, 646, 650, 667, 675, 676, 682

Offset: 1

Hartmut F. W. Hoft, Dec 06 2016

nonn

Let n = 2^m * q with m >= 0 and q odd, let row(n) = floor(sqrt(8*n+1) - 1)/2), and let 1 = d_1 < ... < d_h <= row(n) < d_(h+1) < ... < d_k = q be the k odd divisors of n.
The symmetric representation of sigma(n) consists of 3 parts precisely when there is a unique i, 1 <= i < h, such that 2^(m+1) * d_i < d_(i+1) and d_h <= row(n) < 2^(m+1) * d_h.
This property of the odd divisors of n is equivalent to the n-th row of the irregular triangle of A249223 consisting of a block of positive numbers, followed by a block of zeros, followed in turn by a block of positive numbers, i.e., determining the first part and the left half of the center part of the symmetric representation of sigma(n), resulting in 3 parts.
Let n be the product of two primes p and q satisfying 2 < p < q < 2*p. Then n satisfies the property above so that the odd numbers in A087718 form a subsequence.

			a(4) = 35 = 5*7 is in the sequence since 1 < 2 < 5 < row(35) = 7 < 10;
a(8) = 70 = 2*5*7 is in the sequence since 1 < 4 < 5 < row(70) = 11 < 20;
140 = 4*5*7 is not in the sequence since 1 < 5 < 7 < 8 < row(140) = 16 < 20;
a(506) = 5950 = 2*25*7*17 is in the sequence since 1*4 < 5 is the only pair of odd divisors 1 < 5 < 7 < 17 < 25 < 35 < 85 < row(5950) = 108 satisfying the property (see A251820).

Column 3 of A240062.

Cf. A087718, A174973 (column 1), A237048, A237270, A237271, A237593, A239929 (column 2), A249223, A251820, A262045, A279102.

(* support functions are defined in A237048 and A262045 *)
segmentsSigma[n_] := Length[Select[SplitBy[a262045[n], #!=0&], First[#]!=0&]]
a279102[m_, n_] := Select[Range[m, n], segmentsSigma[#]==3&]
a279102[1, 700] (* sequence data *)
(* An equivalent, but slower computation is based on A237271 *)
a279102[m_, n_] := Select[Range[m, n], a237271[#]==3&]
a279102[1,700] (* sequence data *)

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

A384931 Number of 2-dense sublists of divisors of the number of partitions of n.

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 2, 3, 2, 1, 1, 1, 3, 2, 3, 1, 5, 6, 4, 4, 5, 1, 2, 4, 3, 4, 1, 5, 4, 7, 2, 4, 9, 10, 4, 9, 2, 6, 9, 3, 1, 9, 4, 11, 8, 4, 3, 3, 8, 12, 4, 11, 7, 10, 5, 3, 7, 2, 2, 1, 8, 5, 6, 8, 5, 2, 1, 3, 10, 6, 1, 6, 8, 7, 1, 1, 4, 2, 7, 9, 3, 4, 9, 6, 2

Offset: 0

Omar E. Pol, Jul 30 2025

In a 2-dense 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.

			For n = 7 the number of partitions of 7 is A000041(7) = 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(7) = 3.
For n = 19 the number of partitions of 19 is A000041(19) = 490. The list of divisors of 490 is [1, 2, 5, 7, 10, 14, 35, 49, 70, 98, 245, 490]. There are four 2-dense sublists of divisors of 490, they are [1, 2], [5, 7, 10, 14], [35, 49, 70, 98], [245, 490], so a(19) = 4.

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

Cf. A000041, A174973 (2-dense numbers), A237271, A384149, A384222, A384225, A384226, A384930.

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

a(n) = A237271(A000041(n)). Conjectured.

More terms from Alois P. Heinz, Jul 30 2025

A279029 Numbers k with the property that the smallest and the largest Dyck path of the symmetric representation of sigma(k) do not share line segments.

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 10, 12, 16, 18, 20, 24, 28, 30, 32, 36, 40, 42, 48, 54, 56, 60, 64, 66, 72, 78, 80, 84, 88, 90, 96, 100, 104, 108, 112, 120, 126, 128, 132, 136, 140, 144, 150, 156, 160, 162, 168, 176, 180, 192, 196, 198, 200, 204, 208, 210, 216, 220, 224, 228, 234, 240, 252, 256

Offset: 1

Omar E. Pol, Dec 08 2016

nonn

Numbers k such that the symmetric representation of sigma(k) is formed by only one part, or that it's formed by only two parts and they meet at the center.
Numbers k whose total length of all line segments of the symmetric representation of sigma(k) is equal to 4*k (cf. A348705). For the positive integers k that are not in this sequence the mentioned total length is < 4*k. - Omar E. Pol, Nov 02 2021
From Hartmut F. W. Hoft, Jan 25 2025: (Start)
The following three statements are equivalent for numbers k >= 1:
(1) The symmetric representation of sigma(k) is formed of 2 parts that meet at the diagonal.
(2) A249223(k, A003056(k)) = 0 is the only 0 in row k of the triangle, and A237591(k, A003056(k)) = 1.
(3) Row k of the triangle in A341969 contains a single 0 at the center position.
The following two statements are equivalent for numbers k >= 1:
(1) The symmetric representation of sigma(k) consists of a single part.
(2) Row k of the triangle in A249223 contains no 0. (End)
This sequence is the disjoint union of A262259 and A174973. Each member of A262259 has the form k = q*(2*q + 1) where 2*q + 1 is prime; also A003056(k) = 2*q. Therefore [q, 2*q] contains a divisor q of k while (q, 2*q] contains no divisor of k. A262259 is a subsequence of A298259, see also A240542. - Hartmut F. W. Hoft, Mar 24 2025
My two links below give detailed proofs for the last comment.  - Hartmut F. W. Hoft, Jun 10 2025

			1, 2, 3, 4, 6, 8, 10, 12 and 16 are in the sequence because the smallest and the largest Dyck path of their symmetric representation of sigma do not share line segments, as shown below.
Illustration of initial terms:
  n
  .      _ _ _ _   _   _   _   _       _
  1     |_| | | | | | | | | | | |     | |
  2     |_ _|_| | | | | | | | | |     | |
  3     |_ _|  _|_| | | | | | | |     | |
  4     |_ _ _|    _|_| | | | | |     | |
         _ _ _|  _|  _ _|_| | | |     | |
  6     |_ _ _ _|  _| |  _ _|_| |     | |
         _ _ _ _| |_ _|_|    _ _|     | |
  8     |_ _ _ _ _|  _|     |    _ _ _| |
         _ _ _ _ _| |      _|   |  _ _ _|
  10    |_ _ _ _ _ _|  _ _|    _| |
         _ _ _ _ _ _| |      _|  _|
  12    |_ _ _ _ _ _ _|  _ _|  _|
                        |  _ _|
                        | |
         _ _ _ _ _ _ _ _| |
  16    |_ _ _ _ _ _ _ _ _|
  ...

Antti Karttunen, Table of n, a(n) for n = 1..20000
Hartmut F. W. Hoft, Proof: Dyck Paths of SRS(n) meeting only at diagonal
Hartmut F. W. Hoft, Proofs for A279029 = A174973 union A262259

UNION of A174973 and A262259.
Positions of 0's in A279228.
Complement is A279244.
Cf. A000203, A003056, A008586, A174973, A196020, A235791, A236104, A237270, A237271, A237591, A237593, A249223, A262259, A323648, A348705, A379968 (characteristic function).
Cf. A240542, A298856.

(* Function path[] is defined in A237270 *)
a279029Q[n_] := Length[Select[Transpose[{Take[path[n], {2,-2}], path[n-1]}], #[[1]]==#[[2]]&]]<=1
a279029[n_] := Select[Range[n], a279029Q]
a279029[256]
(* Alternate, faster function based on A249223 *)
a003056[n_] := Floor[(Sqrt[8n+1]-1)/2]
t249223[n_] :=FoldList[#1+(-1)^(#2+1)KroneckerDelta[Mod[n-#2 (#2+1)/2, #2]]&, 1, Range[2, a003056[n]]]
a262259Q[n_] := Position[t249223[n], 0]=={{a003056[n]}}&&Last[t237591[n]]==1
a174973Q[n_] := !MemberQ[t249223[n], 0]
a279029[n_] := Select[Range[n], a262259Q[#]||a174973Q[#]&]
a279029[256] (* Hartmut F. W. Hoft, Jan 25 2025 *)

is_A279029 = A379968; \\ Antti Karttunen, Jan 12 2025

a(n) = A323648(n-1) + 1, for n >= 2. - Hartmut F. W. Hoft, Jan 25 2025

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

A320066 Numbers k with the property that the symmetric representation of sigma(k) has five parts.

Original entry on oeis.org

63, 81, 99, 117, 153, 165, 195, 231, 255, 273, 285, 325, 345, 375, 425, 435, 459, 475, 525, 561, 575, 625, 627, 665, 693, 725, 735, 775, 805, 819, 825, 875, 897, 925, 975, 1015, 1025, 1075, 1085, 1150, 1175, 1225, 1250, 1295, 1377, 1395, 1421, 1435, 1450, 1479, 1505, 1519, 1550, 1581, 1617, 1645, 1653, 1665

Offset: 1

Omar E. Pol, Oct 05 2018

nonn

Those numbers in this sequence with only parts of width 1 in their symmetric representation of sigma form column 5 in the table of A357581. - Hartmut F. W. Hoft, Oct 04 2022

			63 is in the sequence because the 63rd row of A237593 is [32, 11, 6, 4, 2, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 2, 4, 6, 11, 32], and the 62nd row of the same triangle is [32, 11, 5, 4, 3, 2, 1, 2, 1, 1, 1, 1, 2, 1, 2, 3, 4, 5, 11, 32], therefore between both symmetric Dyck paths there are five parts: [32, 12, 16, 12, 32].
The sums of these parts is 32 + 12 + 16 + 12 + 32 = 104, equaling the sum of the divisors of 63: 1 + 3 + 7 + 9 + 21 + 63 = 104.
(The diagram of the symmetric representation of sigma(63) = 104 is too large to include.)

Column 5 of A240062.
Cf. A000203, A018267, A237270 (the parts), A237271 (number of parts), A174973 (one part), A239929 (two parts), A279102 (three parts), A280107 (four parts).
Cf. A236104, A237591, A237593, A239663, A239665, A245092, A262626.
Cf. A341969, A341970, A341971, A357581.

(* function a341969 and support functions are defined in A341969, A341970 and A341971 *)
partsSRS[n_] := Length[Select[SplitBy[a341969[n], #!=0&], #[[1]]!=0&]]
a320066[n_] := Select[Range[n], partsSRS[#]==5&]
a320066[1665] (* Hartmut F. W. Hoft, Oct 04 2022 *)

A357581 Square array read by antidiagonals of numbers whose symmetric representation of sigma consists only of parts that have width 1; column k indicates the number of parts and row n indicates the n-th number in increasing order in each of the columns.

Original entry on oeis.org

1, 2, 3, 4, 5, 9, 8, 7, 25, 21, 16, 10, 49, 27, 81, 32, 11, 50, 33, 625, 147, 64, 13, 98, 39, 1250, 171, 729, 128, 14, 121, 51, 2401, 207, 15625, 903, 256, 17, 169, 55, 4802, 243, 31250, 987, 3025, 512, 19, 242, 57, 14641, 261, 117649, 1029, 3249, 6875

Offset: 1

Hartmut F. W. Hoft, Oct 04 2022

This sequence is a permutation of A174905. Numbers in the even numbered columns of the table form A241008 and those in the odd numbered columns form A241010. The first row of the table is A318843.

This sequence is a subsequence of A240062 and each column in this sequence is a subsequence in the respective column of A240062.

			The upper left hand 11 X 11 section of the table for a(n) <= 2*10^7:
     1   2    3   4      5    6         7     8      9     10        11 ...
  ----------------------------------------------------------------------
     1   3    9  21     81  147       729   903   3025   6875     59049
     2   5   25  27    625  171     15625   987   3249   7203   9765625
     4   7   49  33   1250  207     31250  1029   4761  13203  19531250
     8  10   50  39   2401  243    117649  1113   6561  13527       ...
    16  11   98  51   4802  261    235298  1239   7569  14013       ...
    32  13  121  55  14641  275   1771561  1265   8649  14499       ...
    64  14  169  57  28561  279   3543122  1281  12321  14661       ...
   128  17  242  65  29282  333   4826809  1375  14161  15471       ...
   256  19  289  69  57122  363   7086244  1407  15129  15633       ...
   512  22  338  85  58564  369   9653618  1491  16641  15957       ...
  1024  23  361  87  83521  387  19307236  1533  17689  16119       ...
  ...
Each column k > 1 contains odd and even numbers since, e.g., 5^(k-1) and 2 * 5^(k-1) belong to it.
Column 1: A000079, subsequence of A174973 = A238443, and of column 1 in A240062.
Column 2: A246955, subsequence of A239929; 78 is the smallest number not in A246955.
Column 3: A247687, subsequence of A279102; 15 is the smallest number not in A247687.
  Odd numbers in column 3: A001248(k), k > 1.
Column 4: A264102, subsequence of A280107; 75 is the smallest number not in A264102.
Column 5: subsequence of A320066; 63 = A320066(1) is not in column 5.
  Numbers in column 5 have the form 2^k * p^4 with p > 2 prime and 0 <= k < floor(log_2(p)).
  Odd numbers in column 5: A030514(k), k > 1.
Column 6: subsequence of A320511; 189 is the smallest number not in column 6.
  Smallest even number in column 6 is 5050.
Column 7: Numbers have the form 2^k * p^6 with p > 2 prime and 0 <= k < floor(log_2(p)).
  Odd numbers in column 7: A030516(k), k > 1.
Numbers in the column numbered with the n-th prime p_n have the form: 2^k * p^(p_n - 1) with p > 2 prime and 0 <= k < floor(log_2(p_n)).

Cf. A000079, A001248, A030514, A030516, A174905, A174973, A237593, A238443, A239929, A241008, A241010, A246955, A247687, A264102, A279102, A280107, A318843, A320066, A320511, A341969, A341970, A341971.

(* function a341969 and support functions are defined in A341969, A341970 and A341971 *)
width1Table[n_, {r_, c_}] := Module[{k, list=Table[{}, c], wL, wLen, pCount, colLen}, For[k=1, k<=n, k++, wL=a341969[k]; wLen=Length[wL]; pCount=(wLen+1)/2; If[pCount<=c&&Length[list[[pCount]]]=1, j--, vec[[PolygonalNumber[i+j-2]+j]]=arr[[i, j]]]]; vec]
a357581T[n_, r_] := TableForm[width1Table[n, {r, r}]]
a357581[120000, 10] (* sequence data - first 10 antidiagonals *)
a357581T[120000, 10] (* upper left hand 10x10 array *)
a357581T[20000000, 11] (* 11x11 array - very long computation time *)

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

Omar E. Pol, Aug 25 2018

nonn

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.

			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.

Paolo Xausa, Table of n, a(n) for n = 1..10000
Index entries for sequences related to sigma(n)

A317307 is a subsequence.
Cf. A174973.
Cf. A000203, A047836, A196020, A236104, A235791, A237048, A237591, A237593, A237270, A237271, A239660, A239931, A239932, A239933, A239934, A244050, A245092, A262626, A361208.

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 *)

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

A320511 Numbers k with the property that the symmetric representation of sigma(k) has six parts.

Original entry on oeis.org

147, 171, 189, 207, 243, 261, 275, 279, 297, 333, 351, 363, 369, 387, 423, 429, 465, 477, 507, 531, 549, 555, 595, 603, 605, 615, 639, 645, 657, 663, 705, 711, 715, 741, 747, 795, 801, 833, 845, 867, 873, 885, 909, 915, 927, 931, 935, 963, 969, 981, 1005, 1017, 1045, 1065, 1071, 1083, 1095, 1105, 1127

Offset: 1

Omar E. Pol, Oct 14 2018

nonn

Those numbers in this sequence with only parts of width 1 in their symmetric representation of sigma form column 6 in the table of A357581. - Hartmut F. W. Hoft, Oct 04 2022

			147 is in the sequence because the 147th row of A237593 is [74, 25, 13, 8, 5, 4, 4, 2, 2, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 4, 4, 5, 8, 13, 25, 74], and the 146th row of the same triangle is [74, 25, 12, 8, 6, 4, 3, 2, 2, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 4, 6, 8, 12, 25, 74], therefore between both symmetric Dyck paths there are six parts: [74, 26, 14, 14, 26, 74].
Note that the sum of these parts is 74 + 26 + 14 + 14 + 26 + 74 = 228, equaling the sum of the divisors of 147: 1 + 3 + 7 + 21 + 49 + 147 = 228.
(The diagram of the symmetric representation of sigma(147) = 228 is too large to include.)

Column 6 of A240062.
Cf. A237270 (the parts), A237271 (number of parts), A174973 (one part), A239929 (two parts), A279102 (three parts), A280107 (four parts), A320066 (five parts).
Cf. A000203, A018303, A196020, A235791, A236104, A237048, A237591, A237593, A239663, A239665, A245092, A262626, A296508.
Cf. A341969, A341970, A341971, A357581.

(* function a341969 and support functions are defined in A341969, A341970 and A341971 *)
partsSRS[n_] := Length[Select[SplitBy[a341969[n], #!=0&], #[[1]]!=0&]]
a320511[n_] := Select[Range[n], partsSRS[#]==6&]
a320511[1127] (* Hartmut F. W. Hoft, Oct 04 2022 *)

cp's OEIS Frontend

A262259 Numbers k such that the symmetric representation of sigma(k) has only two parts and they meet at the center of the Dyck path.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A279102 Numbers n having three parts in the symmetric representation of sigma(n).

Views

Author

Keywords

Comments

Examples

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

A384931 Number of 2-dense sublists of divisors of the number of partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A279029 Numbers k with the property that the smallest and the largest Dyck path of the symmetric representation of sigma(k) do not share line segments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

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

A320066 Numbers k with the property that the symmetric representation of sigma(k) has five parts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A357581 Square array read by antidiagonals of numbers whose symmetric representation of sigma consists only of parts that have width 1; column k indicates the number of parts and row n indicates the n-th number in increasing order in each of the columns.

Views

Author

Keywords