A281012 -id:A281012 - cp's OEIS frontend

A281007 Number of middle divisors of the n-th number that has middle divisors.

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

Offset: 1

Omar E. Pol, Feb 11 2017

nonn

Conjecture 1: also widths of the successive terraces that we can find descending by the main diagonal of the pyramid described in A245092. Hence, bisection of A281012.
Conjecture 2: also number of central subparts in the symmetric representation of sigma of the numbers j that have the property that the number of parts in the symmetric representation of sigma(j) is odd.
Conjecture 3: Partial sums give A282131.

Positive terms in A067742.

Cf. A071562, A196020, A235791, A236104, A237048, A237270, A237271, A237591, A237593, A240542, A244050, A244367, A244580, A245092, A262626, A279387, A280919, A281012, A282131.

DeleteCases[#, 0] &@ Table[Count[Divisors@ n, d_ /; Sqrt[n/2] <= d < Sqrt[2 n]], {n, 300}] (* Michael De Vlieger, Feb 12 2017 *)

a(n) = A067742(A071562(n)).

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.

cp's OEIS Frontend

A281007 Number of middle divisors of the n-th number that has middle divisors.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

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