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 41 results. Next

A379379 Sum of odd divisors of n except the "e" odd divisors described in A005279.

Original entry on oeis.org

1, 1, 4, 1, 6, 1, 8, 1, 13, 6, 12, 1, 14, 8, 19, 1, 18, 1, 20, 1, 32, 12, 24, 1, 31, 14, 40, 1, 30, 1, 32, 1, 48, 18, 41, 1, 38, 20, 56, 1, 42, 1, 44, 12, 49, 24, 48, 1, 57, 31, 72, 14, 54, 1, 72, 1, 80, 30, 60, 1, 62, 32, 95, 1, 84, 1, 68, 18, 96, 41, 72, 1, 74
Offset: 1

Views

Author

Omar E. Pol, Dec 21 2024

Keywords

Comments

Shares infinitely many terms with A000593.
a(n) = A000593(n) if n is not in A005279.
a(n) < A000593(n) if n is in A005279.
Conjectures from Omar E. Pol, Aug 27 2025: (Start)
a(n) is the sum of the smallest numbers of the 2-dense sublists of divisors of n.
a(n) is the sum of the divisors p of n such that p is greater than twice the adjacent previous divisor of n. (End)

Crossrefs

Programs

  • Mathematica
    a[n_] := Module[{d = Partition[Divisors[n], 2, 1]}, 1 + Total[Select[d, OddQ[#[[2]]] && #[[2]] >= 2*#[[1]] &][[;; , 2]]]]; Array[a, 100] (* Amiram Eldar, Dec 22 2024 *)

Extensions

More terms from Alois P. Heinz, Dec 22 2024

A379374 Irregular triangle read by rows in which row n lists the divisors of n except the divisors "e" described in A005279.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 2, 4, 1, 5, 1, 2, 6, 1, 7, 1, 2, 4, 8, 1, 3, 9, 1, 2, 5, 10, 1, 11, 1, 2, 12, 1, 13, 1, 2, 7, 14, 1, 3, 15, 1, 2, 4, 8, 16, 1, 17, 1, 2, 6, 18, 1, 19, 1, 2, 4, 10, 20, 1, 3, 7, 21, 1, 2, 11, 22, 1, 23, 1, 2, 24, 1, 5, 25, 1, 2, 13, 26, 1, 3, 9, 27
Offset: 1

Views

Author

Omar E. Pol, Dec 21 2024

Keywords

Comments

Observation: the sequence of the number of odd terms in row n coincides with at least the first 10000 terms of A237271.
The observation is true for all numbers. For a proof see A379288. - Hartmut F. W. Hoft, Jan 25 2025

Examples

			Triangle begins:
  1;
  1,  2;
  1,  3;
  1,  2,  4;
  1,  5;
  1,  2,  6;
  1,  7;
  1,  2,  4,  8;
  1,  3,  9;
  1,  2,  5, 10;
  1, 11;
  1,  2, 12;
  1, 13;
  1,  2,  7, 14;
  1,  3, 15;
  1,  2,  4,  8, 16;
  1, 17;
  1,  2,  6, 18;
  1, 19;
  1,  2,  4, 10, 20;
  ...
		

Crossrefs

Subsequence of A027750.
Row sums give A379384.
Odd terms give A379288.

Programs

  • Mathematica
    row[n_] := Module[{d = Partition[Divisors[n], 2, 1]}, Join[{1}, Select[d, #[[2]] >= 2*#[[1]] &][[;; , 2]]]]; Table[row[n], {n, 1, 27}] // Flatten (* Amiram Eldar, Dec 22 2024 *)

Extensions

More terms from Alois P. Heinz, Dec 21 2024

A379384 Sum of the divisors of n except the "e" divisors described in A005279.

Original entry on oeis.org

1, 3, 4, 7, 6, 9, 8, 15, 13, 18, 12, 15, 14, 24, 19, 31, 18, 27, 20, 37, 32, 36, 24, 27, 31, 42, 40, 49, 30, 33, 32, 63, 48, 54, 41, 39, 38, 60, 56, 67, 42, 65, 44, 84, 49, 72, 48, 51, 57, 93, 72, 98, 54, 81, 72, 91, 80, 90, 60, 63, 62, 96, 95, 127, 84, 97, 68
Offset: 1

Views

Author

Omar E. Pol, Dec 22 2024

Keywords

Comments

Shares infinitely many terms with A000203.
a(n) = A000203(n) if n is not in A005279.
a(n) < A000203(n) if n is in A005279.

Crossrefs

Programs

  • Mathematica
    a[n_] := Module[{d = Partition[Divisors[n], 2, 1]}, 1 + Total[Select[d, #[[2]] >= 2*#[[1]] &][[;; , 2]]]]; Array[a, 100] (* Amiram Eldar, Dec 22 2024 *)

Extensions

More terms from Alois P. Heinz, Dec 22 2024

A302022 Primitive terms from A005279.

Original entry on oeis.org

6, 15, 20, 28, 35, 63, 77, 88, 91, 99, 104, 110, 117, 130, 143, 153, 170, 187, 190, 209, 221, 238, 247, 266, 272, 299, 304, 322, 323, 325, 357, 368, 391, 399, 425, 437, 464, 475, 483, 493, 496, 506, 513, 527, 551, 575, 589, 609, 621, 638, 651, 667, 682, 703, 713, 725, 754, 759, 775, 777, 783, 806, 814
Offset: 1

Views

Author

David A. Corneth, Mar 31 2018

Keywords

Comments

Also numbers k such that k is in A005279 but none of the proper divisors of k are.
All terms k are composites; if k is prime then it's not in A005279 hence not here. If k = m * t and t < m < 2*t then m and t are coprime. If g = gcd(t, m) > 1 then the integer k / g^2 is in A005279. If there is some term u*t where with u > 2*t and gcd(u, t) = 1 then there is some m * t' with gcd(m, t') = 1 such that m*t' | t * u and t * u wouldn't be in the sequence. if u = 2*t then gcd(u, t) = t which can't happen.
It could be that both m and t are composite, for example, t = 53^2 and m = 5^5 gives the term 53^2 * 5^5.
Interestingly, k = m * t where t < m < 2 * t and m * t is in A005279 and m, t coprime gives A106430; this sequence is a subsequence of A106430.

Examples

			77 is a term since it is in A005279 and 77 is not of the form A005279(i)*t for t > 1.
		

Crossrefs

Subsequence of A020886 and hence of A005279.

Programs

  • PARI
    is005279(n) = my(d=divisors(n)); for(i=3, #d, if(d[i]<2*d[i-1], return(1))); 0;
    is(n) = if (is005279(n), d = divisors(n); for (k=1, #d-1, if (is005279(d[k]), return (0));); return(1);); \\ Altug Alkan, Apr 14 2018
    upto(n) = {my(res = List()); for(i = 2, sqrtint(n), for(j = i+1, min(2 * i - 1, n\i), if(gcd(i, j) == 1, if(is(i*j), listput(res, i*j))))); listsort(res); return(res)} \\ David A. Corneth, Apr 15 2018

Formula

A301989(a(n)) = 1.

A046793 Numbers n such that arithmetic and harmonic means of a(n) and A005279(n) both integers.

Original entry on oeis.org

2, 4, 3, 6, 12, 8, 4, 6, 15, 12, 10, 14, 5, 16, 18, 8, 12, 35, 6, 28, 24, 15, 21, 26, 20, 12, 40, 10, 7, 32, 63, 60, 34, 24, 21, 36, 90, 16, 38, 45, 8, 36, 70, 12, 15, 46, 20, 99, 18, 30, 9, 42, 52, 40, 54, 33, 24, 30, 58, 75, 66, 20, 14, 62, 55, 105, 10, 64, 39, 28, 18, 50, 68, 48, 33
Offset: 1

Views

Author

Keywords

A053629 Smallest integer where the harmonic mean of a(n) and A005279(n) is an integer.

Original entry on oeis.org

2, 4, 3, 6, 5, 8, 4, 6, 14, 12, 10, 7, 5, 16, 18, 8, 12, 18, 6, 28, 9, 15, 21, 26, 20, 12, 33, 10, 7, 32, 22, 25, 34, 24, 21, 36, 11, 16, 38, 45, 8, 21, 39, 12, 15, 46, 20, 26, 18, 30, 9, 42, 13, 40, 54, 33, 24, 30, 58, 70, 66, 20, 14, 62, 55, 54, 10, 64, 30, 28, 18, 50, 68, 48
Offset: 1

Views

Author

Henry Bottomley, Mar 20 2000

Keywords

Comments

if m is not in A005279 then smallest integer to have an integer harmonic mean with m is m

Crossrefs

A053628 Smallest integer which is the harmonic mean of A005279(n) and an integer.

Original entry on oeis.org

3, 6, 5, 9, 8, 12, 7, 10, 20, 18, 16, 12, 9, 24, 27, 14, 20, 28, 11, 40, 16, 25, 33, 39, 32, 21, 48, 18, 13, 48, 36, 40, 51, 39, 35, 54, 20, 28, 57, 65, 15, 36, 60, 22, 27, 69, 35, 44, 32, 50, 17, 66, 24, 64, 81, 55, 42, 51, 87, 100, 96, 36, 26, 93, 85, 84, 19, 96, 52, 49, 33
Offset: 1

Views

Author

Henry Bottomley, Mar 20 2000

Keywords

Comments

If m is not in A005279 then smallest harmonic mean is m.

Crossrefs

Cf. A005279.

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.

A010814 Perimeters of integer-sided right triangles.

Original entry on oeis.org

12, 24, 30, 36, 40, 48, 56, 60, 70, 72, 80, 84, 90, 96, 108, 112, 120, 126, 132, 140, 144, 150, 154, 156, 160, 168, 176, 180, 182, 192, 198, 200, 204, 208, 210, 216, 220, 224, 228, 234, 240, 252, 260, 264, 270, 276, 280, 286, 288, 300, 306, 308, 312, 320, 324
Offset: 1

Views

Author

Ben Manvel (manvel(AT)lagrange.math.colostate.edu)

Keywords

Comments

A number k is in this sequence iff k is a multiple of some term in A024364.

Crossrefs

Twice A005279.
Cf. A024364.

Programs

  • Maple
    isA010814 := proc(an) local a::integer,b::integer,c::integer ; for c from 1 to floor(an/2) do for a from floor(c/sqrt(2)) to c-1 do if issqr(c^2-a^2) then b := sqrt(c^2-a^2) ; if a+b+c = an then RETURN(true) ; fi ; fi ; od ; od : RETURN(false) ; end : for n from 3 to 400 do if isA010814(n) then printf("%d,",n) ; fi ; od ; # R. J. Mathar, Jun 08 2006
  • Mathematica
    lst={};Do[Do[If[IntegerQ[c=Sqrt[a^2+b^2]],AppendTo[lst,a+b+c]],{b,a-1,Floor[Sqrt[a]],-1}],{a,4,4*5!}];Take[Union@lst,100] (* Vladimir Joseph Stephan Orlovsky, Nov 23 2010 *)
    q[n_] := EvenQ[n] && Module[{d = Divisors[n/2]}, AnyTrue[Range[3, Length[d]], d[[#]] < 2 * d[[#-1]] &]]; Select[Range[350], q] (* Amiram Eldar, Oct 19 2024 *)
  • PARI
    select( {is_A010814(n)=n%2==0&&is_A005279(n\2)}, [1..333]) \\ M. F. Hasler, Mar 20 2025

Extensions

More terms from Ray Chandler, Mar 13 2004
Showing 1-10 of 41 results. Next