A279286 -id:A279286 - cp's OEIS frontend

A282197 a(n) is the smallest number d if the point (d,d) is shared by exactly n different Dyck paths in the main diagonal of the diagram of the symmetries of sigma described in A237593.

1, 2, 7, 15, 52, 102, 296, 371, 455, 929, 1853, 2034, 4517, 4797, 5829, 6146, 6948, 17577, 19818, 18915, 60349, 78369, 113010, 110185, 91650, 85171, 311321, 123788, 823049, 128596, 1650408, 1136865, 415355, 906771, 2897535

Offset: 1

Hartmut F. W. Hoft, Feb 08 2017

This sequence is not monotone since a(19) = 19818 > 18915 = a(20).
Additional values smaller than 5000000 are a(37) = 1751785, a(38) = 1786732, a(39) = 1645139, a(41) = 1308771 and a(44) = 3329668.
Sequence A128605 of first occurrences of gaps between adjacent Dyck paths appears to be unrelated to this sequence.
First differs from A279286 (which is monotone) at a(19). - Omar E. Pol, Feb 08 2017
a(n) = d if the point (d,d) belongs to the first vertical-line-segment of exactly length n found in the main diagonal of the pyramid described in A245092 (starting from the top). The diagram of the symmetries of sigma is also the top view of the pyramid. - Omar E. Pol, Feb 09 2017

			The four examples listed in A279286 are also examples for this sequences.
a(20) = 18915 is in the sequence since it is the first time that exactly 20 Dyck paths meet on the diagonal though a concurrence of exactly 19 paths on the diagonal happens only later at a(19) = 19818.

Cf. A128605, A237593, A240542, A245092, A279286.

a240542[n_] := Sum[(-1)^(k+1)*Ceiling[(n+1)/k - (k+1)/2], {k, 1, Floor[(Sqrt[8n+1]-1)/2]}]
(* parameter cL must be sufficiently large for bound b *)
a282197[cL_, b_] := Module[{centers=Map[0&, Range[cL]], acc={1}, k=2, cPrev=1, cCur, len}, While[k<=b, cCur=a240542[k]; If[Last[acc]==cCur, AppendTo[acc,cCur], len=Length[acc]; If[centers[[len]]==0, centers[[len]]=cPrev]; acc={cCur}; cPrev=cCur]; k++]; centers]
a282197[50, 5000000] (* data *)
(* list processing implementation useful for "small" arguments only *)
a282197F[n_] := Map[Last, Sort[Normal[Map[First[First[#]]&, GroupBy[Split[Map[a240542, Range[n]]], Length[#]&]]]]]
a282197F[50000] (* computes a(1) .. a(20) *)

A320051 Square array read by antidiagonals upwards: T(n,k) is the n-th positive integer with exactly k middle divisors, n >= 1, k >= 0.

Original entry on oeis.org

3, 5, 1, 7, 2, 6, 10, 4, 12, 72, 11, 8, 15, 144, 120, 13, 9, 20, 288, 180, 1800, 14, 16, 24, 400, 240, 3528, 840, 17, 18, 28, 450, 252, 4050, 1080, 3600, 19, 25, 30, 576, 336, 5184, 1260, 7200, 2520, 21, 32, 35, 648, 360, 7056, 1440, 14112, 5040, 28800, 22, 36, 40, 800, 378, 8100, 1680, 14400, 5544

Offset: 1

Omar E. Pol, Oct 04 2018

This is a permutation of the natural numbers.
For the definition of middle divisors see A067742.
Conjecture 1: T(n,k) is also the n-th positive integer j with the property that the difference between the number of partitions of j into an odd number of consecutive parts and the number of partitions of j into an even number of consecutive parts is equal to k.
Conjecture 2: T(n,k) is also the n-th positive integer j with the property that the symmetric representation of sigma(j) has width k on the main diagonal.

			The corner of the square array begins:
   3,  1,  6,  72, 120, 1800,  840,  3600, 2520, 28800, ...
   5,  2, 12, 144, 180, 3528, 1080,  7200, 5040, ...
   7,  4, 15, 288, 240, 4050, 1260, 14112, ...
  10,  8, 20, 400, 252, 5184, 1440, ...
  11,  9, 24, 450, 336, 7056, ...
  13, 16, 28, 576, 360, ...
  14, 18, 30, 648, ...
  17, 25, 35, ...
  19, 32, ...
  21, ...
  ...
In accordance with the conjecture 1, T(1,0) = 3 because there is only one partition of 3 into an odd number of consecutive parts: [3], and there is only one partition of 3 into an even number of consecutive parts: [2, 1], therefore the difference of the number of those partitions is 1 - 1 = 0.
On the other hand, in accordance with the conjecture 2: T(1,0) = 3 because the symmetric representation of sigma(3) = 4 has width 0 on the main diagonal, as shown below:
.    _ _
.   |_ _|_
.       | |
.       |_|
.
In accordance with the conjecture 1, T(1,2) = 6 because there are three partitions of 6 into an odd number of consecutive parts: [6], [3, 2, 1], and there are no partitions of 6 into an even number of consecutive parts, therefore the difference of the number of those partitions is 2 - 0 = 2.
On the other hand, in accordance with the conjecture 2: T(1,2) = 6 because the symmetric representation of sigma(6) = 12 has width 2 on the main diagonal, as shown below:
.    _ _ _ _
.   |_ _ _  |_
.         |   |_
.         |_ _  |
.             | |
.             | |
.             |_|
.

Index entries for sequences that are permutations of the natural numbers

Row 1 is A128605.
Column 0 is A071561.
The union of the rest of the columns gives A071562.
Column 1 is A320137.
Column 2 is A320142.
For more information about the diagrams see A237593.
For tables of partitions into consecutive parts see A286000 and A286001.
Cf. A067742, A240542, A245092, A249351 (widths), A262626, A279286, A280849, A281007, A299761, A299777, A303297, A319529, A319796, A319801, A319802.

A299472 a(n) is the sum of all divisors of all numbers k whose associated largest Dyck path contains the point (n,n) in the diagram of the symmetric representation of sigma(k) described in A237593, or 0 if no such k exists.

Original entry on oeis.org

1, 7, 13, 0, 20, 15, 43, 0, 66, 0, 24, 49, 59, 0, 134, 0, 60, 113, 0, 86, 0, 104, 165, 0, 48, 245, 0, 132, 0, 224, 0, 198, 0, 124, 57, 317, 0, 192, 0, 350, 0, 326, 0, 104, 211, 0, 434, 0, 216, 0, 0, 647, 0, 344, 0, 186, 331, 0, 584, 0, 270, 0, 234, 0, 672, 0, 350, 171, 0, 156, 639, 0, 672, 0, 390, 0, 368, 0, 956

Offset: 1

Omar E. Pol, Feb 19 2018

nonn

Row sums of A299693.

Cf. A196020, A235791, A236104, A237048, A237591, A237593, A240542, A245092, A259179, A276112, A277437, A279286, A279385, A280919, A280223, A282131, A282197, A280295, A281012.

A299693 Irregular triangle read by rows in which row n lists the total sum of the divisors of all numbers k such that the largest Dyck path of the symmetric representation of sigma(k) contains the point (n,n); or row n is 0 if no such k exists.

Original entry on oeis.org

1, 3, 4, 7, 6, 0, 12, 8, 15, 13, 18, 12, 0, 28, 14, 24, 0, 24, 31, 18, 39, 20, 0, 42, 32, 36, 24, 0, 60, 31, 42, 40, 0, 56, 30, 0, 72, 32, 63, 48, 54, 0, 48, 91, 38, 60, 56, 0, 90, 42, 0, 96, 44, 84, 0, 78, 72, 48, 0, 124, 57, 93, 72, 98, 54, 0, 120, 72, 0, 120, 80, 90, 60, 0, 168, 62, 96, 0, 104, 127, 84, 0

Offset: 1

Omar E. Pol, Feb 19 2018

			Triangle begins:
   1;
   3,  4;
   7,  6;
   0;
  12,  8;
  15;
  13, 18, 12;
   0;
  28, 14, 24;
   0;
  24;
  31, 18;
  39, 20;
   0;
  42, 32, 36, 24;
   0;
...

Nonzero terms give A000203.
Row sums give A299472.
Cf. A259179(n) is the number of positive terms in row n.
Cf. A071562, A196020, A235791, A236104, A237048, A237591, A237593, A240542, A244050, A245092, A276112, A277437, A279286, A279385, A280919, A280223, A282131, A282197, A280295, A281012.

T(n,m) = A000203(A279385(n,m)) if A279385(n,m) > 0, otherwise T(n,m) = 0.

A319139 a(n) is the smallest position k >= 1 on the diagonal at which a record gap of size n between two adjacent Dyck paths of the symmetric representation of sigma starts.

Original entry on oeis.org

4, 50, 82, 1246, 581, 2494, 1744, 19961, 6981, 61136, 19210, 179669, 34935, 122268, 57628, 244539, 96062, 2415480, 192141, 978161, 249769, 1956341, 576404, 2200863, 499557

Offset: 1

Hartmut F. W. Hoft, Sep 11 2018

This sequence of positions of record gaps on the diagonal is not increasing, in contrast to the apparently increasing sequence A279286 of record numbers of Dyck paths jointly crossing the diagonal.
For n >= 2 it appears that a(2*n) > a(2*n+1), however a(2*n) < a(2*n+2) is false as a(12) = 179669 and a(14) = 122268 show, just as a(2n-1) < a(2*n+1) is false as a(23) = 576404 and a(25) = 499557 show.
Additional values of this sequence: a(27) = 1152829, a(29) = 999115, a(31) = 1498678, a(33) = 2305659.

			A240542(119) = 81 and A240542(120) = A240542(A128605(4)) = 85 establish the starting position on the diagonal of the first gap of size 3 as 82 = a(3).
A240542(3484799) = 2415479 and A240542(3484800) = A240542(A128605(19)) = 2415498 establish the starting position on the diagonal of the first gap of size 18 as 2415480 = a(18).

Cf. A128605, A237593, A240542, A279286.

a240542[n_] := Sum[(-1)^(k+1)Ceiling[(n+1)/k-(k+1)/2], {k, 1, Floor[(Sqrt[8n+1]-1)/2]}]
(* parameter recs is the list of elements of the sequence in interval 1..m-1 already computed with an entry of 0 representing an element not yet found *)
a319139[m_, n_, recs_, ext_] := Module[{list=Join[recs, Table[0, ext]], a=a240542[m], i, b, g}, For[i=m+1, i<=n, i++, b=a240542[i]; g=b-a-1; If[g>0 && list[[g]]==0, list[[g]]=a+1]; a=b]; list]
a319139[1,3500000,{},40] (* data *)

It appears that a(n) = A240542(A128605(n+1)-1) + 1.

cp's OEIS Frontend

A282197 a(n) is the smallest number d if the point (d,d) is shared by exactly n different Dyck paths in the main diagonal of the diagram of the symmetries of sigma described in A237593.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A320051 Square array read by antidiagonals upwards: T(n,k) is the n-th positive integer with exactly k middle divisors, n >= 1, k >= 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A299472 a(n) is the sum of all divisors of all numbers k whose associated largest Dyck path contains the point (n,n) in the diagram of the symmetric representation of sigma(k) described in A237593, or 0 if no such k exists.

Views

Author

Keywords

Crossrefs

A299693 Irregular triangle read by rows in which row n lists the total sum of the divisors of all numbers k such that the largest Dyck path of the symmetric representation of sigma(k) contains the point (n,n); or row n is 0 if no such k exists.

Views

Author

Keywords

Examples

Crossrefs

Formula

A319139 a(n) is the smallest position k >= 1 on the diagonal at which a record gap of size n between two adjacent Dyck paths of the symmetric representation of sigma starts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula