cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 44 results. Next

A071540 Number of k's less than or equal to 10^n such that there are no middle divisors of k (A071561).

Original entry on oeis.org

4, 57, 664, 7068, 73130, 747244, 7590269, 76830140, 775940042, 7824134360
Offset: 1

Views

Author

Robert G. Wilson v, May 31 2002

Keywords

Crossrefs

Programs

  • Mathematica
    f[n_] := Plus @@ Select[ Divisors[n], Sqrt[n/2] <= # < Sqrt[n*2] &]; s = 0; k = 0; Do[ While[k < 10^n, k++; If[ f[k] == 0, s++ ]]; Print[s], {n, 1, 7}]
  • PARI
    lista(nmax) = {my(c = 0, pow = 10); for(k = 1, 10^nmax, if(sumdiv(k, d, if(d^2 >= k/2 && d^2 < 2*k, d, 0)) == 0, c++); if(k == pow, print1(c, ", "); pow *= 10));} \\ Amiram Eldar, Jul 27 2024

Formula

a(n) = 10^n - A071541(n). - Amiram Eldar, Jul 27 2024

Extensions

a(8) from Sean A. Irvine, Jul 24 2024
a(9)-a(10) from Amiram Eldar, Jul 27 2024

A368609 a(n) = A368945(A071561(n)).

Original entry on oeis.org

0, 2, 4, 0, 8, 10, 2, 14, 16, 0, 6, 20, 8, 2, 26, 28, 4, 12, 34, 14, 6, 38, 40, 2, 18, 44, 10, 4, 50, 0, 12, 24, 56, 58, 26, 2, 64, 8, 16, 68, 70, 32, 4, 10, 0, 76, 36, 80, 6, 38, 22, 86, 14, 24, 42, 8, 94, 98, 4, 100, 0, 48, 104, 106, 30, 110, 6, 12, 20, 54, 2, 56, 34, 22, 14, 124, 36, 128, 4, 62
Offset: 1

Views

Author

Hartmut F. W. Hoft, Jan 25 2024

Keywords

Comments

This sequence lists all nonnegative numbers in A368945, all of which are even.
Conjecture: Every nonnegative even number occurs in this sequence.

Examples

			a(4) = A368945(A071561(4)) = A368945(10) = 0 and a(5) = A368945(A071561(5)) = A368945(11) = 8.
For numbers k <= 10^6 the largest width 0 extent instantiated is 999980 for prime 999983 and the smallest width 0 extent not instantiated by any k <= 10^6 is 31396.
		

Crossrefs

Programs

  • Mathematica
    a071561Q[n_] := Select[Divisors[n], Sqrt[n/2]<=#A249223 *)
    zeroExt[n_] := Module[{s=Position[t249223[n], 1][[-1, -1]]}, 2 Ceiling[(n+1)/(s+1)-(s+1)/2]-2]
    a368609[n_] := Map[zeroExt, Select[Range[n], a071561Q]]
    a368609[135]

A241561 Duplicate of A071561.

Original entry on oeis.org

3, 5, 7, 10, 11, 13, 14, 17, 19, 21, 22, 23, 26, 27, 29, 31, 33, 34, 37, 38, 39, 41, 43, 44, 46, 47, 51, 52, 53, 55, 57, 58, 59, 61, 62, 65, 67, 68, 69, 71, 73, 74, 75, 76, 78, 79, 82, 83, 85, 86, 87, 89, 92, 93, 94, 95, 97, 101, 102, 103, 105, 106, 107, 109, 111, 113, 114
Offset: 1

Views

Author

Keywords

A237271 Number of parts in the symmetric representation of sigma(n).

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 2, 3, 1, 2, 1, 2, 1, 4, 2, 2, 1, 3, 2, 4, 1, 2, 1, 2, 1, 4, 2, 3, 1, 2, 2, 4, 1, 2, 1, 2, 2, 3, 2, 2, 1, 3, 3, 4, 2, 2, 1, 4, 1, 4, 2, 2, 1, 2, 2, 5, 1, 4, 1, 2, 2, 4, 3, 2, 1, 2, 2, 4, 2, 3, 2, 2, 1, 5, 2, 2, 1, 4, 2, 4, 1, 2, 1
Offset: 1

Views

Author

Omar E. Pol, Feb 25 2014

Keywords

Comments

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

Examples

			Illustration of initial terms (n = 1..12):
---------------------------------------------------------
n   A000203  A237270    a(n)            Diagram
---------------------------------------------------------
.                               _ _ _ _ _ _ _ _ _ _ _ _
1       1      1         1     |_| | | | | | | | | | | |
2       3      3         1     |_ _|_| | | | | | | | | |
3       4      2+2       2     |_ _|  _|_| | | | | | | |
4       7      7         1     |_ _ _|    _|_| | | | | |
5       6      3+3       2     |_ _ _|  _|  _ _|_| | | |
6      12      12        1     |_ _ _ _|  _| |  _ _|_| |
7       8      4+4       2     |_ _ _ _| |_ _|_|    _ _|
8      15      15        1     |_ _ _ _ _|  _|     |
9      13      5+3+5     3     |_ _ _ _ _| |      _|
10     18      9+9       2     |_ _ _ _ _ _|  _ _|
11     12      6+6       2     |_ _ _ _ _ _| |
12     28      28        1     |_ _ _ _ _ _ _|
...
For n = 9 the sum of divisors of 9 is 1+3+9 = A000203(9) = 13. On the other hand the 9th set of symmetric regions of the diagram is formed by three regions (or parts) with 5, 3 and 5 cells, so the total number of cells is 5+3+5 = 13, equaling the sum of divisors of 9. There are three parts: [5, 3, 5], so a(9) = 3.
From _Omar E. Pol_, Dec 21 2016: (Start)
Illustration of the diagram of subparts (n = 1..12):
---------------------------------------------------------
n   A000203  A279391  A001227           Diagram
---------------------------------------------------------
.                               _ _ _ _ _ _ _ _ _ _ _ _
1       1      1         1     |_| | | | | | | | | | | |
2       3      3         1     |_ _|_| | | | | | | | | |
3       4      2+2       2     |_ _|  _|_| | | | | | | |
4       7      7         1     |_ _ _|  _ _|_| | | | | |
5       6      3+3       2     |_ _ _| |_|  _ _|_| | | |
6      12      11+1      2     |_ _ _ _|  _| |  _ _|_| |
7       8      4+4       2     |_ _ _ _| |_ _|_|  _ _ _|
8      15      15        1     |_ _ _ _ _|  _|  _| |
9      13      5+3+5     3     |_ _ _ _ _| |  _|  _|
10     18      9+9       2     |_ _ _ _ _ _| |_ _|
11     12      6+6       2     |_ _ _ _ _ _| |
12     28      23+5      2     |_ _ _ _ _ _ _|
...
For n = 6 the symmetric representation of sigma(6) has two subparts: [11, 1], so A000203(6) = 12 and A001227(6) = 2.
For n = 12 the symmetric representation of sigma(12) has two subparts: [23, 5], so A000203(12) = 28 and A001227(12) = 2. (End)
From _Hartmut F. W. Hoft_, Dec 26 2016: (Start)
Two examples of the general argument in the Comments section:
Rows 27 in A237048 and A249223 (4 parts)
i:  1  2 3 4 5 6 7 8 9 . . 12
27: 1  1 1 0 0 1                           1's in A237048 for odd divisors
    1 27 3     9                           odd divisors represented
27: 1  0 1 1 1 0 0 1 1 1 0 1               blocks forming parts in A249223
Rows 81 in A237048 and A249223 (5 parts)
i:  1  2 3 4 5 6 7 8 9 . . 12. . . 16. . . 20. . . 24
81: 1  1 1 0 0 1 0 0 1 0 0 0                          1's in A237048 f.o.d
    1 81 3    27     9                                odd div. represented
81: 1  0 1 1 1 0 0 0 1 1 1 1 1 1 1 1 0 0 0 1 1 1 0 1  blocks fp in A249223
(End)
		

Crossrefs

Programs

  • Mathematica
    a237271[n_] := Length[a237270[n]] (* code defined in A237270 *)
    Map[a237271, Range[90]] (* data *)
    (* Hartmut F. W. Hoft, Jun 23 2014 *)
    a[n_] := Module[{d = Partition[Divisors[n], 2, 1]}, 1 + Count[d, ?(OddQ[#[[2]]] && #[[2]] >= 2*#[[1]] &)]]; Array[a, 100] (* _Amiram Eldar,  Dec 22 2024 *)
  • PARI
    fill(vcells, hga, hgb) = {ic = 1; for (i=1, #hgb, if (hga[i] < hgb[i], for (j=hga[i], hgb[i]-1, cell = vector(4); cell[1] = i - 1; cell[2] = j; vcells[ic] = cell; ic ++;););); vcells;}
    findfree(vcells) = {for (i=1, #vcells, vcelli = vcells[i]; if ((vcelli[3] == 0) && (vcelli[4] == 0), return (i));); return (0);}
    findxy(vcells, x, y) = {for (i=1, #vcells, vcelli = vcells[i]; if ((vcelli[1]==x) && (vcelli[2]==y) && (vcelli[3] == 0) && (vcelli[4] == 0), return (i));); return (0);}
    findtodo(vcells, iz) = {for (i=1, #vcells, vcelli = vcells[i]; if ((vcelli[3] == iz) && (vcelli[4] == 0), return (i)); ); return (0);}
    zcount(vcells) = {nbz = 0; for (i=1, #vcells, nbz = max(nbz, vcells[i][3]);); nbz;}
    docell(vcells, ic, iz) = {x = vcells[ic][1]; y = vcells[ic][2]; if (icdo = findxy(vcells, x-1, y), vcells[icdo][3] = iz); if (icdo = findxy(vcells, x+1, y), vcells[icdo][3] = iz); if (icdo = findxy(vcells, x, y-1), vcells[icdo][3] = iz); if (icdo = findxy(vcells, x, y+1), vcells[icdo][3] = iz); vcells[ic][4] = 1; vcells;}
    docells(vcells, ic, iz) = {vcells[ic][3] = iz; while (ic, vcells = docell(vcells, ic, iz); ic = findtodo(vcells, iz);); vcells;}
    nbzb(n, hga, hgb) = {vcells = vector(sigma(n)); vcells = fill(vcells, hga, hgb); iz = 1; while (ic = findfree(vcells), vcells = docells(vcells, ic, iz); iz++;); zcount(vcells);}
    lista(nn) = {hga = concat(heights(row237593(0), 0), 0); for (n=1, nn, hgb = heights(row237593(n), n); nbz = nbzb(n, hga, hgb); print1(nbz, ", "); hga = concat(hgb, 0););} \\ with heights() also defined in A237593; \\ Michel Marcus, Mar 28 2014
    
  • Python
    from sympy import divisors
    def a(n: int) -> int:
        divs = list(divisors(n))
        d = [divs[i:i+2] for i in range(len(divs) - 1)]
        s = sum(1 for pair in d if len(pair) == 2 and pair[1] % 2 == 1 and pair[1] >= 2 * pair[0])
        return s + 1
    print([a(n) for n in range(1, 80)])  # Peter Luschny, Aug 05 2025

Formula

a(n) = A001227(n) - A239657(n). - Omar E. Pol, Mar 23 2014
a(p^k) = k + 1, where p is an odd prime and k >= 0. - Hartmut F. W. Hoft, Dec 26 2016
Theorem: a(n) <= number of odd divisors of n (cf. A001227). The differences are in A239657. - N. J. A. Sloane, Jan 19 2021
a(n) = A340846(n) - A340833(n) + 1 (Euler's formula). - Omar E. Pol, Feb 01 2021
a(n) = A000005(n) - A243982(n). - Omar E. Pol, Aug 02 2025

A262626 Visible parts of the perspective view of the stepped pyramid whose structure essentially arises after the 90-degree-zig-zag folding of the isosceles triangle A237593.

Original entry on oeis.org

1, 1, 1, 3, 2, 2, 2, 2, 2, 1, 1, 2, 7, 3, 1, 1, 3, 3, 3, 3, 2, 2, 3, 12, 4, 1, 1, 1, 1, 4, 4, 4, 4, 2, 1, 1, 2, 4, 15, 5, 2, 1, 1, 2, 5, 5, 3, 5, 5, 2, 2, 2, 2, 5, 9, 9, 6, 2, 1, 1, 1, 1, 2, 6, 6, 6, 6, 3, 1, 1, 1, 1, 3, 6, 28, 7, 2, 2, 1, 1, 2, 2, 7, 7, 7, 7, 3, 2, 1, 1, 2, 3, 7, 12, 12, 8, 3, 1, 2, 2, 1, 3, 8, 8, 8, 8, 8, 3, 2, 1, 1
Offset: 1

Views

Author

Omar E. Pol, Sep 26 2015

Keywords

Comments

Also the rows of both triangles A237270 and A237593 interleaved.
Also, irregular triangle read by rows in which T(n,k) is the area of the k-th region (from left to right in ascending diagonal) of the n-th symmetric set of regions (from the top to the bottom in descending diagonal) in the two-dimensional diagram of the perspective view of the infinite stepped pyramid described in A245092 (see the diagram in the Links section).
The diagram of the symmetric representation of sigma is also the top view of the pyramid, see Links section. For more information about the diagram see also A237593 and A237270.
The number of cubes at the n-th level is also A024916(n), the sum of all divisors of all positive integers <= n.
Note that this pyramid is also a quarter of the pyramid described in A244050. Both pyramids have infinitely many levels.
Odd-indexed rows are also the rows of the irregular triangle A237270.
Even-indexed rows are also the rows of the triangle A237593.
Lengths of the odd-indexed rows are in A237271.
Lengths of the even-indexed rows give 2*A003056.
Row sums of the odd-indexed rows gives A000203, the sum of divisors function.
Row sums of the even-indexed rows give the positive even numbers (see A005843).
Row sums give A245092.
From the front view of the stepped pyramid emerges a geometric pattern which is related to A001227, the number of odd divisors of the positive integers.
The connection with the odd divisors of the positive integers is as follows: A261697 --> A261699 --> A237048 --> A235791 --> A237591 --> A237593 --> A237270 --> this sequence.

Examples

			Irregular triangle begins:
  1;
  1, 1;
  3;
  2, 2;
  2, 2;
  2, 1, 1, 2;
  7;
  3, 1, 1, 3;
  3, 3;
  3, 2, 2, 3;
  12;
  4, 1, 1, 1, 1, 4;
  4, 4;
  4, 2, 1, 1, 2, 4;
  15;
  5, 2, 1, 1, 2, 5;
  5, 3, 5;
  5, 2, 2, 2, 2, 5;
  9, 9;
  6, 2, 1, 1, 1, 1, 2, 6;
  6, 6;
  6, 3, 1, 1, 1, 1, 3, 6;
  28;
  7, 2, 2, 1, 1, 2, 2, 7;
  7, 7;
  7, 3, 2, 1, 1, 2, 3, 7;
  12, 12;
  8, 3, 1, 2, 2, 1, 3, 8;
  8, 8, 8;
  8, 3, 2, 1, 1, 1, 1, 2, 3, 8;
  31;
  9, 3, 2, 1, 1, 1, 1, 2, 3, 9;
  ...
Illustration of the odd-indexed rows of triangle as the diagram of the symmetric representation of sigma which is also the top view of the stepped pyramid:
.
   n  A000203    A237270    _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
   1     1   =      1      |_| | | | | | | | | | | | | | | |
   2     3   =      3      |_ _|_| | | | | | | | | | | | | |
   3     4   =    2 + 2    |_ _|  _|_| | | | | | | | | | | |
   4     7   =      7      |_ _ _|    _|_| | | | | | | | | |
   5     6   =    3 + 3    |_ _ _|  _|  _ _|_| | | | | | | |
   6    12   =     12      |_ _ _ _|  _| |  _ _|_| | | | | |
   7     8   =    4 + 4    |_ _ _ _| |_ _|_|    _ _|_| | | |
   8    15   =     15      |_ _ _ _ _|  _|     |  _ _ _|_| |
   9    13   =  5 + 3 + 5  |_ _ _ _ _| |      _|_| |  _ _ _|
  10    18   =    9 + 9    |_ _ _ _ _ _|  _ _|    _| |
  11    12   =    6 + 6    |_ _ _ _ _ _| |  _|  _|  _|
  12    28   =     28      |_ _ _ _ _ _ _| |_ _|  _|
  13    14   =    7 + 7    |_ _ _ _ _ _ _| |  _ _|
  14    24   =   12 + 12   |_ _ _ _ _ _ _ _| |
  15    24   =  8 + 8 + 8  |_ _ _ _ _ _ _ _| |
  16    31   =     31      |_ _ _ _ _ _ _ _ _|
  ...
The above diagram arises from a simpler diagram as shown below.
Illustration of the even-indexed rows of triangle as the diagram of the deployed front view of the corner of the stepped pyramid:
.
.                                 A237593
Level                               _ _
1                                 _|1|1|_
2                               _|2 _|_ 2|_
3                             _|2  |1|1|  2|_
4                           _|3   _|1|1|_   3|_
5                         _|3    |2 _|_ 2|    3|_
6                       _|4     _|1|1|1|1|_     4|_
7                     _|4      |2  |1|1|  2|      4|_
8                   _|5       _|2 _|1|1|_ 2|_       5|_
9                 _|5        |2  |2 _|_ 2|  2|        5|_
10              _|6         _|2  |1|1|1|1|  2|_         6|_
11            _|6          |3   _|1|1|1|1|_   3|          6|_
12          _|7           _|2  |2  |1|1|  2|  2|_           7|_
13        _|7            |3    |2 _|1|1|_ 2|    3|            7|_
14      _|8             _|3   _|1|2 _|_ 2|1|_   3|_             8|_
15    _|8              |3    |2  |1|1|1|1|  2|    3|              8|_
16   |9                |3    |2  |1|1|1|1|  2|    3|                9|
...
The number of horizontal line segments in the n-th level in each side of the diagram equals A001227(n), the number of odd divisors of n.
The number of horizontal line segments in the left side of the diagram plus the number of the horizontal line segment in the right side equals A054844(n).
The total number of vertical line segments in the n-th level of the diagram equals A131507(n).
The diagram represents the first 16 levels of the pyramid.
The diagram of the isosceles triangle and the diagram of the top view of the pyramid shows the connection between the partitions into consecutive parts and the sum of divisors function (see also A286000 and A286001). - _Omar E. Pol_, Aug 28 2018
The connection between the isosceles triangle and the stepped pyramid is due to the fact that this object can also be interpreted as a pop-up card. - _Omar E. Pol_, Nov 09 2022
		

Crossrefs

Famous sequences that are visible in the stepped pyramid:
Cf. A000040 (prime numbers)......., for the characteristic shape see A346871.
Cf. A000079 (powers of 2)........., for the characteristic shape see A346872.
Cf. A000203 (sum of divisors)....., total area of the terraces in the n-th level.
Cf. A000217 (triangular numbers).., for the characteristic shape see A346873.
Cf. A000225 (Mersenne numbers)...., for a visualization see A346874.
Cf. A000384 (hexagonal numbers)..., for the characteristic shape see A346875.
Cf. A000396 (perfect numbers)....., for the characteristic shape see A346876.
Cf. A000668 (Mersenne primes)....., for a visualization see A346876.
Cf. A001097 (twin primes)........., for a visualization see A346871.
Cf. A001227 (# of odd divisors)..., number of subparts in the n-th level.
Cf. A002378 (oblong numbers)......, for a visualization see A346873.
Cf. A008586 (multiples of 4)......, perimeters of the successive levels.
Cf. A008588 (multiples of 6)......, for the characteristic shape see A224613.
Cf. A013661 (zeta(2))............., (area of the horizontal faces)/(n^2), n -> oo.
Cf. A014105 (second hexagonals)..., for the characteristic shape see A346864.
Cf. A067742 (# of middle divisors), # cells in the main diagonal in n-th level.
Apart from zeta(2) other constants that are related to the stepped pyramid are A072691, A353908, A354238.

A067742 Number of middle divisors of n, i.e., divisors in the half-open interval [sqrt(n/2), sqrt(n*2)).

Original entry on oeis.org

1, 1, 0, 1, 0, 2, 0, 1, 1, 0, 0, 2, 0, 0, 2, 1, 0, 1, 0, 2, 0, 0, 0, 2, 1, 0, 0, 2, 0, 2, 0, 1, 0, 0, 2, 1, 0, 0, 0, 2, 0, 2, 0, 0, 2, 0, 0, 2, 1, 1, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 0, 2, 1, 0, 2, 0, 0, 0, 2, 0, 3, 0, 0, 0, 0, 2, 0, 0, 2, 1, 0, 0, 2, 0, 0, 0, 2, 0, 2, 2, 0, 0, 0, 0, 2, 0, 1, 2, 1, 0, 0, 0, 2, 0
Offset: 1

Views

Author

Marc LeBrun, Jan 29 2002

Keywords

Comments

Comment from N. J. A. Sloane, Jan 03 2021: (Start)
Theorem 1: (i) a(n) = (number of odd divisors of n <= sqrt(2*n)) - (number of odd divisors of n > sqrt(2*n)).
(ii) Let r(n) = A003056(n). Then a(n) = (number of odd divisors of n <= r(n)) - (number of odd divisors of n > r(n)).
(iii) a(n) = Sum_{k=1..r(n)} (-1)^(k+1)*A237048(n,k).
(iv) a(n) is odd iff n is a square or twice a square (cf. A053866). Indices of odd terms give A028982. Indices of even terms give A028983.
The proofs are straightforward. These results were conjectured by Omar E. Pol in 2017. (End)
Theorem 2: a(n) is equal to the difference between the number of partitions of n into an odd number of consecutive parts and the number of partitions of n into an even number of consecutive parts. [Chapman et al., 2001; Hirschhorn and Hirschhorn, 2005]. - Omar E. Pol, Feb 06 2017
From Omar E. Pol, Feb 06 2017: (Start)
Conjecture 1: This is the central column of the isosceles triangle of A249351.
Conjecture 2: a(n) is also the width of the terrace at the n-th level in the main diagonal of the pyramid described in A245092.
Conjecture 3: a(n) is also the number of central subparts of the symmetric representation of sigma(n). For more information see A279387.
Conjectures 2 and 3 were proposed after Michel Marcus's conjecture in A237593. (End)
Conjectures 1, 2, and 3 are all true. - N. J. A. Sloane, Feb 11 2021

Examples

			a(6)=2 because the 2 middle divisors of 6 (2 and 3) are between sqrt(3) and sqrt(12).
		

References

  • Robin Chapman, Kimmo Eriksson and Richard Stanley, On the Number of Divisors of n in a Special Interval: Problem 10847, Amer. Math. Monthly 108:1 (Jan 2001), p. 77 (Proposal); 109:1 (Jan 2002), p. 80 (Solution). [Please do not delete this reference. - N. J. A. Sloane, Dec 16 2020]

Crossrefs

Cf. A001227, A003056, A028982, A028983, A053866, A067743, A071090 (sums of middle divisors), A082647, A128605, A131576.
Cf. also A071561 (positions of zeros), A071562 (positions of nonzeros), A299761 (middle divisors of n), A355143 (products of middle divisors).
Relation to Dyck paths: A237048, A237593, A240542 (partial sums), A245092, A249351, A279387, A348406.

Programs

  • Mathematica
    (* number of middle divisors *)
    a067742[n_] := Select[Divisors[n], Sqrt[n/2] <= # < Sqrt[2n] &]
    a067742[115] (* data *)
    (* Hartmut F. W. Hoft, Jul 17 2014 *)
    a[ n_] := If[ n < 1, 0, DivisorSum[ n, 1 &, n/2 <= #^2 < 2 n &]]; (* Michael Somos, Jun 04 2015 *)
    (* support function a240542[] is defined in A240542 *)
    b[n_] := a240542[n] - a240542[n-1]
    Map[b,Range[105]] (* data - Hartmut F. W. Hoft, Feb 06 2017 *)
  • PARI
    A067742(n) = {sumdiv(n, d, d2 = d^2; n / 2 < d2 && d2 <= n << 1)} \\ M. F. Hasler, May 12 2008
    
  • PARI
    a(n) = A067742(n) = {my(d = divisors(n), iu = il = #d \ 2); if(#d <= 2, return(n < 3)); while(d[il]^2 > n>>1, il--); while(d[iu]^2 < (n<<1), iu++);
    iu - il - 1 + issquare(n/2)} \\ David A. Corneth, Apr 06 2018
    
  • Python
    from sympy import divisors
    def A067742(n): return sum(1 for d in divisors(n,generator=True) if n <= 2*d**2 < 4*n) # Chai Wah Wu, Jun 09 2022

Formula

G.f.: Sum_{k>=1} (-1)^(k-1)*x^(k*(k+1)/2)/(1-x^k). (This g.f. corresponds to the assertion in Theorem 2.)
Another g.f., corresponding to the definition: Sum_{k>=1} x^(2*k*(k+1))*(1-x^(6*k^2))/(1-x^(2*k)) + Sum_{k>=0} x^((k+1)*(2*k+1))*(1-x^((2*k+1)*(3*k+2)))/(1-x^(2*k+1)). - N. J. A. Sloane, Jan 04 2021
a(A128605(n)) = n and a(m) <> n for m < A128605(n). - Reinhard Zumkeller, Mar 14 2007
It appears that a(n) = A240542(n) - A240542(n-1), the difference between two adjacent Dyck paths as defined in A237593. - Hartmut F. W. Hoft, Feb 06 2017
The above conjecture is essentially the same as Michel Marcus's conjecture in A237593. - Omar E. Pol, Dec 20 2020
Conjecture: a(n) = A082647(n) - A131576(n) = A001227(n) - 2*A131576(n). - Omar E. Pol, Feb 06 2017
a(n) = A348406(n) - 1. - Omar E. Pol, Oct 29 2021
a(n) = A000005(n) - A067743(n). - Omar E. Pol, Jun 11 2022

Extensions

Edited by N. J. A. Sloane, Jan 03 2021

A071562 Numbers n such that the sum of the middle divisors of n (A071090) is not zero.

Original entry on oeis.org

1, 2, 4, 6, 8, 9, 12, 15, 16, 18, 20, 24, 25, 28, 30, 32, 35, 36, 40, 42, 45, 48, 49, 50, 54, 56, 60, 63, 64, 66, 70, 72, 77, 80, 81, 84, 88, 90, 91, 96, 98, 99, 100, 104, 108, 110, 112, 117, 120, 121, 126, 128, 130, 132, 135, 140, 143, 144, 150, 153, 154, 156, 160
Offset: 1

Views

Author

Robert G. Wilson v, May 30 2002

Keywords

Comments

Numbers n such that A067742(n) is nonzero.
Numbers of the form m*k with m <= k <= 2m. - Vladeta Jovovic, May 07 2005
Numbers occurring in A100345 (except 0). - Franklin T. Adams-Watters, Apr 04 2010
This sequence is closed under multiplication. If n = a*b with a <= b <= 2a, and m = c*d with c <= d <= 2c, then min(a*d,b*c)*max(a*d,b*c) is a factorization of m*n with the specified property. - Franklin T. Adams-Watters, Apr 07 2010
Also numbers n with the property that the number of parts in the symmetric representation of sigma(n) is odd. - Michel Marcus and Omar E. Pol, Apr 25 2014. (For a proof see the link in A071561.) - Hartmut F. W. Hoft, Sep 09 2015
Among these numbers, those with sigma(n) also odd are 1, 2, 4, 8, 9, 16, ..., that is, probably A028982 (squares and twice squares). - Michel Marcus, Jun 21 2014
Records in A244367. - Omar E. Pol, Jul 27 2014
Starting from a(5), the sequence is a subset of a sequence formed out of the prime factorization of A129912(m), m >= 5; see associated PARI code in Prog section. - Bill McEachen, Jan 25 2018
For numbers n = 2^m * q, m >= 0, q odd, and where r(n) = floor( (sqrt(8n+1) - 1)/2 ), the symmetric representation of sigma(n) has an odd number of parts precisely when there exists an odd divisor d of n satisfying d <= r(n) and d*2^(m+1) > r(n); see the link for a proof and see the associated Mathematica code. - Hartmut F. W. Hoft, Feb 12 2018
All hexagonal numbers A000384 > 0 are in the sequence. - Omar E. Pol, Aug 28 2018

Examples

			From _Hartmut F. W. Hoft_, Feb 12 2018: (Start)
63 = 3^2*7 is in the sequence since 7*2^1 > r(63) = 10.
80 = 2^4*5 is in the sequence since 1*2^5 > r(80) = 12. (End)
		

Crossrefs

Cf. A067742.
The complement is A071561.

Programs

  • Mathematica
    f[n_] := Plus @@ Select[ Divisors[n], Sqrt[n/2] <= # < Sqrt[n*2] &]; Select[ Range[175], f[ # ] != 0 &]
    (* Related to the symmetric representation of sigma *)
    (* subsequence of odd parts of number k for m <= k <= n *)
    (* Function a237270[] is defined in A237270 *)
    (* Using Wilson's Mathematica program (see above) I verified the equality of both for numbers k <= 10000 *)
    a071562[m_,n_]:=Select[Range[m,n],OddQ[Length[a237270[#]]]&]
    a071562[1,160] (* data *)
    (* Hartmut F. W. Hoft, Jun 23 2014 *)
    (* implementation using the odd divisor property *)
    evenExp[n_] := First[NestWhile[{#[[1]]+1, #[[2]]/2}&, {0, n}, EvenQ[Last[#]]&]]
    oddSRQ[n_] := Module[{e=2^evenExp[n], Floor[(Sqrt[8n+1]-1)/2]}, Select[Divisors[n/e], #<=r&&2 e #>r&]!={}]
    a071562D[m_, n_] := Select[Range[m, n], oddSRQ]
    a071562D[1, 160] (* data *) (* Hartmut F. W. Hoft, Feb 12 2018 *)
  • PARI
    is(n)=fordiv(n,d, if(d^2>=n/2 && d^2<2*n, return(1))); 0 \\ Charles R Greathouse IV, Aug 01 2016
    
  • PARI
    is(n,f=factor(n))=my(t=(n+1)\2); fordiv(f,d, if(d^2>=t, return(d^2<2*n))); 0 \\ Charles R Greathouse IV, Jan 22 2018
    
  • PARI
    list(lim)=my(v=List(),t); forfactored(n=1,lim\1, t=(n[1]+1)\2; fordiv(n[2],d, if(d^2>=t, if(d^2<2*n[1], listput(v,n[1])); break))); Vec(v) \\ Charles R Greathouse IV, Jan 22 2018
    
  • PARI
    /* functional code associated to the A129912 comment above */ for(j5=5, length(A129912), a=Mat(); a=factor(A129912[j5]); sum2=0; for(i5=1, length(a[,2]), sum2=sum2+a[i5,2]); listput(final,length(a[,1])*sum2)); v=Set(final); \\ Bill McEachen, Jan 25 2018

A071090 Sum of middle divisors of n.

Original entry on oeis.org

1, 1, 0, 2, 0, 5, 0, 2, 3, 0, 0, 7, 0, 0, 8, 4, 0, 3, 0, 9, 0, 0, 0, 10, 5, 0, 0, 11, 0, 11, 0, 4, 0, 0, 12, 6, 0, 0, 0, 13, 0, 13, 0, 0, 14, 0, 0, 14, 7, 5, 0, 0, 0, 15, 0, 15, 0, 0, 0, 16, 0, 0, 16, 8, 0, 17, 0, 0, 0, 17, 0, 23, 0, 0, 0, 0, 18, 0, 0, 18, 9, 0, 0, 19, 0, 0, 0, 19, 0, 19, 20, 0, 0
Offset: 1

Views

Author

N. J. A. Sloane, May 27 2002

Keywords

Comments

Divisors are in the half-open interval [sqrt(n/2), sqrt(n*2)).
Row sums of A299761. - Omar E. Pol, Jun 11 2022

Crossrefs

Programs

  • Maple
    A071090 := proc(n)
        a := 0 ;
        for d in numtheory[divisors](n) do
            if d^2 >= n/2 and d^2 < n*2 then
                a := a+d ;
            end if;
        end do:
        a;
    end proc: # R. J. Mathar, Jun 18 2015
  • Mathematica
    Table[Plus @@ Select[ Divisors[n], Sqrt[n/2] <= # < Sqrt[n*2] &], {n, 1, 95}]
  • PARI
    a(n)=sumdiv(n,d, if(d^2>=n/2 && d^2<2*n, d, 0)) \\ Charles R Greathouse IV, Aug 01 2016

Formula

a(n) = A000203(n) - A302433(n). - Omar E. Pol, Jun 11 2022

A239929 Numbers n with the property that the symmetric representation of sigma(n) has two parts.

Original entry on oeis.org

3, 5, 7, 10, 11, 13, 14, 17, 19, 22, 23, 26, 29, 31, 34, 37, 38, 41, 43, 44, 46, 47, 52, 53, 58, 59, 61, 62, 67, 68, 71, 73, 74, 76, 78, 79, 82, 83, 86, 89, 92, 94, 97, 101, 102, 103, 106, 107, 109, 113, 114, 116, 118, 122, 124, 127, 131, 134, 136, 137, 138
Offset: 1

Views

Author

Omar E. Pol, Apr 06 2014

Keywords

Comments

All odd primes are in the sequence because the parts of the symmetric representation of sigma(prime(i)) are [m, m], where m = (1 + prime(i))/2, for i >= 2.
There are no odd composite numbers in this sequence.
First differs from A173708 at a(13).
Since sigma(p*q) >= 1 + p + q + p*q for odd p and q, the symmetric representation of sigma(p*q) has more parts than the two extremal ones of size (p*q + 1)/2; therefore, the above comments are true. - Hartmut F. W. Hoft, Jul 16 2014
From Hartmut F. W. Hoft, Sep 16 2015: (Start)
The following two statements are equivalent:
(1) The symmetric representation of sigma(n) has two parts, and
(2) n = q * p where q is in A174973, p is prime, and 2 * q < p.
For a proof see the link and also the link in A071561.
This characterization allows for much faster computation of numbers in the sequence - function a239929F[] in the Mathematica section - than computations based on Dyck paths. The function a239929Stalk[] gives rise to the associated irregular triangle whose columns are indexed by A174973 and whose rows are indexed by A065091, the odd primes. (End)
From Hartmut F. W. Hoft, Dec 06 2016: (Start)
For the respective columns of the irregular triangle with fixed m: k = 2^m * p, m >= 1, 2^(m+1) < p and p prime:
(a) each number k is representable as the sum of 2^(m+1) but no fewer consecutive positive integers [since 2^(m+1) < p].
(b) each number k has 2^m as largest divisor <= sqrt(k) [since 2^m < sqrt(k) < p].
(c) each number k is of the form 2^m * p with p prime [by definition].
m = 1: (a) A100484 even semiprimes (except 4 and 6)
(b) A161344 (except 4, 6 and 8)
(c) A001747 (except 2, 4 and 6)
m = 2: (a) A270298
(b) A161424 (except 16, 20, 24, 28 and 32)
(c) A001749 (except 8, 12, 20 and 28)
m = 3: (a) A270301
(b) A162528 (except 64, 72, 80, 88, 96, 104, 112 and 128)
(c) sequence not in OEIS
b(i,j) = A174973(j) * {1,5) mod 6 * A174973(j), for all i,j >= 1; see A091999 for j=2. (End)

Examples

			From _Hartmut F. W. Hoft_, Sep 16 2015: (Start)
a(23) = 52 = 2^2 * 13 = q * p with q = 4 in A174973 and 8 < 13 = p.
a(59) = 136 = 2^3 * 17 = q * p with q = 8 in A174973 and 16 < 17 = p.
The first six columns of the irregular triangle through prime 37:
   1    2    4    6    8   12 ...
  -------------------------------
   3
   5   10
   7   14
  11   22   44
  13   26   52   78
  17   34   68  102  136
  19   38   76  114  152
  23   46   92  138  184
  29   58  116  174  232  348
  31   62  124  186  248  372
  37   74  148  222  296  444
  ...
(End)
		

Crossrefs

Programs

  • Maple
    isA174973 := proc(n)
        option remember;
        local k,dvs;
        dvs := sort(convert(numtheory[divisors](n),list)) ;
        for k from 2 to nops(dvs) do
            if op(k,dvs) > 2*op(k-1,dvs) then
                return false;
            end if;
        end do:
        true ;
    end proc:
    A174973 := proc(n)
        if n = 1 then
            1;
        else
            for a from procname(n-1)+1 do
                if isA174973(a) then
                    return a;
                end if;
            end do:
        end if;
    end proc:
    isA239929 := proc(n)
        local i,p,j,a73;
        for i from 1 do
            p := ithprime(i+1) ;
            if p > n then
                return false;
            end if;
            for j from 1 do
                a73 := A174973(j) ;
                if a73 > n then
                    break;
                end if;
                if p > 2*a73 and n = p*a73 then
                    return true;
                end if;
            end do:
        end do:
    end proc:
    for n from 1 to 200 do
        if isA239929(n) then
            printf("%d,",n) ;
        end if;
    end do: # R. J. Mathar, Oct 04 2018
  • Mathematica
    (* sequence of numbers k for m <= k <= n having exactly two parts *)
    (* Function a237270[] is defined in A237270 *)
    a239929[m_, n_]:=Select[Range[m, n], Length[a237270[#]]==2&]
    a239929[1, 260] (* data *)
    (* Hartmut F. W. Hoft, Jul 07 2014 *)
    (* 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 satisfying the condition *)
    a239929Stalk[start_, bound_]:=Module[{p=NextPrime[2 start], list={}}, While[start p<=bound, AppendTo[list, start p]; p=NextPrime[p]]; list]
    a239929F[n_]:=Sort[Flatten[Map[a239929Stalk[#, n]&, a174973[n]]]]
    a239929F[138] (* data *)(* Hartmut F. W. Hoft, Sep 16 2015 *)

Formula

Entries b(i, j) in the irregular triangle with rows indexed by i>=1 and columns indexed by j>=1 (alternate indexing of the example):
b(i,j) = A000040(i+1) * A174973(j) where A000040(i+1) > 2 * A174973(j). - Hartmut F. W. Hoft, Dec 06 2016

Extensions

Extended beyond a(56) by Michel Marcus, Apr 07 2014

A299761 Irregular triangle read by rows: T(n,k), n >= 1, k >= 1, in which row n lists the middle divisors of n, or 0 if there are no middle divisors of n.

Original entry on oeis.org

1, 1, 0, 2, 0, 2, 3, 0, 2, 3, 0, 0, 3, 4, 0, 0, 3, 5, 4, 0, 3, 0, 4, 5, 0, 0, 0, 4, 6, 5, 0, 0, 4, 7, 0, 5, 6, 0, 4, 0, 0, 5, 7, 6, 0, 0, 0, 5, 8, 0, 6, 7, 0, 0, 5, 9, 0, 0, 6, 8, 7, 5, 0, 0, 0, 6, 9, 0, 7, 8, 0, 0, 0, 6, 10, 0, 0, 7, 9, 8, 0, 6, 11, 0, 0, 0, 7, 10, 0, 6, 8, 9, 0, 0, 0, 0, 7, 11, 0, 0, 8, 10
Offset: 1

Views

Author

Omar E. Pol, Jun 08 2018

Keywords

Comments

The middle divisors of n are the divisors in the half-open interval [sqrt(n/2), sqrt(n*2)).

Examples

			Triangle begins (rows 1..16):
1;
1;
0;
2;
0;
2, 3;
0;
2;
3;
0;
0;
3, 4;
0;
0;
3, 5;
4;
...
For n = 6 the middle divisors of 6 are 2 and 3, so row 6 is [2, 3].
For n = 7 there are no middle divisors of 7, so row 7 is [0].
For n = 8 the middle divisor of 8 is 2, so row 8 is [2].
For n = 72 the middle divisors of 72 are 6, 8 and 9, so row 72 is [6, 8, 9].
		

Crossrefs

Row sums give A071090.
The number of nonzero terms in row n is A067742(n).
Nonzero terms give A303297.
Indices of the rows where there are zeros give A071561.
Indices of the rows where there are nonzero terms give A071562.

Programs

  • Mathematica
    Table[Select[Divisors@ n, Sqrt[n/2] <= # < Sqrt[2 n] &] /. {} -> {0}, {n, 80}] // Flatten (* Michael De Vlieger, Jun 14 2018 *)
  • PARI
    row(n) = my(v=select(x->((x >= sqrt(n/2)) && (x < sqrt(n*2))), divisors(n))); if (#v, v, [0]); \\ Michel Marcus, Aug 04 2022
Showing 1-10 of 44 results. Next