A158649 -id:A158649 - cp's OEIS frontend

A018253 Divisors of 24.

1, 2, 3, 4, 6, 8, 12, 24

Offset: 1

The divisors of 24 greater than 1 are the only positive integers n with the property m^2 == 1 (mod n) for all integer m coprime to n. - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Jun 10 2001
Numbers n for which all Dirichlet characters are real. - Benoit Cloitre, Apr 21 2002
These are the numbers n that are divisible by all numbers less than or equal to the square root of n. - Tanya Khovanova, Dec 10 2006 [For a proof, see the Tauvel paper in references. - Bernard Schott, Dec 20 2012]
Also, numbers n such that A160812(n) = 0. - Omar E. Pol, Jun 19 2009
It appears that these are the only positive integers n such that A160812(n) = 0. - Omar E. Pol, Nov 17 2009
24 is a highly composite number: A002182(6)=24. - Reinhard Zumkeller, Jun 21 2010
Chebolu points out that these are exactly the numbers for which the multiplication table of the integers mod n have 1s only on their diagonal, i.e., ab == 1 (mod n) implies a = b (mod n). - Charles R Greathouse IV, Jul 06 2011
It appears that 3, 4, 6, 8, 12, 24 (the divisors >= 3 of 24) are also the only numbers n whose proper non-divisors k are prime numbers if k = d-1 and d divides n. - Omar E. Pol, Sep 23 2011
About the last Pol's comment: I have searched to 10^7 and have found no other terms. - Robert G. Wilson v, Sep 23 2011
Sum_{i=1..8} A000005(a(i))^3 = (Sum_{i=1..8} A000005(a(i)))^2, see Kordemsky in References and Barbeau et al. in Links section. - Bruno Berselli, Dec 29 2014

			Square root of 12 = 3.46... and 1, 2 and 3 divide 12.
From the tenth comment: 1^3 + 2^3 + 2^3 + 3^3 + 4^3 + 4^3 + 6^3 + 8^3 = (1+2+2+3+4+4+6+8)^2 = 900. - _Bruno Berselli_, Dec 28 2014

Harvey Cohn, "Advanced Number Theory", Dover, chap.II, p. 38
Boris A. Kordemsky, The Moscow Puzzles: 359 Mathematical Recreations, C. Scribner's Sons (1972), Chapter XIII, Paragraph 349.
Patrick Tauvel, "Exercices d'algèbre générale et d'arithmétique", Dunod, 2004, exercice 70 page 368.

John Baez, My Favorite Number: 24, The Rankin Lectures (September 19, 2008).
Edward Barbeau and Samer Seraj, Sum of Cubes is Square of Sum, arXiv:1306.5257 [math.NT], 2013.
Paul T. Bateman and Marc E. Low, Prime numbers in arithmetic progressions with difference 24, The American Mathematical Monthly 72:2 (Feb., 1965), pp. 139-143.
Sunil K. Chebolu, What is special about the divisors of 24?, Math. Mag., 85 (2012), 366-372.
M. H. Eggar, A curious property of the integer 24, Math. Gazette 84 (2000), pp. 96-97.
J. C. Lagarias (proposer), Problem 11747, Amer. Math. Monthly, 121 (2014), 83.
Eric Weisstein's World of Mathematics, Modulo Multiplication Group
Index entries for sequences related to divisors of numbers

Cf. A174228, A018256, A018261, A018266, A018293, A018321, A018350, A018412, A018609, A018676, A178877, A178878, A165412, A178858-A178864.
Cf. A000005, A158649. - Bruno Berselli, Dec 29 2014
Cf. A303704 (with respect to Astudillo's 2001 comment above).

DivisorsInt(24); # Bruno Berselli, Feb 13 2018

Divisors[24] (* Vladimir Joseph Stephan Orlovsky, Feb 16 2012 *)

divisors(24) \\ Charles R Greathouse IV, Apr 28 2011

divisors(24); # Zerinvary Lajos, Jun 13 2009

a(n) = A161710(n-1). - Reinhard Zumkeller, Jun 21 2009

A018255 Divisors of 30.

Original entry on oeis.org

1, 2, 3, 5, 6, 10, 15, 30

Offset: 1

N. J. A. Sloane

For n > 1, These are also numbers m such that k^4 + (k+1)^4 + ... + (k + m - 1)^4 is prime for some k and numbers m such that k^8 + (k+1)^8 + ... + (k + m - 1)^8 is prime for some k. - Derek Orr, Jun 12 2014
These seem to be the numbers m such that tau(n) = n*sigma(n) mod m for all n. See A098108 (mod 2), A126825 (mod 3), and A126832 (mod 5). - Charles R Greathouse IV, Mar 17 2022
The squarefree 5-smooth numbers: intersection of A051037 and A005117. - Amiram Eldar, Sep 26 2023

			From the second comment: 1^3 + 2^3 + 2^3 + 2^3 + 4^3 + 4^3 + 4^3 + 8^3 = (1 + 2 + 2 + 2 + 4 + 4 + 4 + 8)^2 = 729. - _Bruno Berselli_, Dec 28 2014

Boris A. Kordemsky, The Moscow Puzzles: 359 Mathematical Recreations, C. Scribner's Sons (1972), Chapter XIII, Paragraph 349.

Edward Barbeau and Samer Seraj, Sum of Cubes is Square of Sum, arXiv:1306.5257 [math.NT], 2013.
Index entries for sequences related to divisors of numbers.

Cf. A000005, A005117, A051037, A158649, A161715.

Cf. A098108, A126825, A126832.

Divisors(30); // Bruno Berselli, Dec 28 2014

Divisors[30] (* Vladimir Joseph Stephan Orlovsky, Dec 04 2010 *)

PARI
```
divisors(30)
```

a(n) = A161715(n-1). - Reinhard Zumkeller, Jun 21 2009

Sum_{i=1..8} A000005(a(i))^3 = (Sum_{i=1..8} A000005(a(i)))^2, see Kordemsky in References and Barbeau et al. in Links section. - Bruno Berselli, Dec 28 2014

A369469 a(n) = number of integer solutions to 1 <= x1 < x2 < ... < xn to 1/x1 + ... + 1/xn = (1 - 1/x1) * ... * (1 - 1/xn).

Original entry on oeis.org

1, 1, 1, 24, 293, 9219, 787444

Offset: 1

Max Alekseyev, Jan 23 2024

For any n, A369470(n) >= a(n) >= 1 (see A369607).

Max Muller et al., The diophantine equation \sum_{n=1}^{N} \frac{1}{x_{n}} = \prod_{k=1}^{N} \left(1-\frac{1}{x_{k}} \right), MathOverflow, 2024.

Cf. A006585, A007850, A054377, A085098, A118086, A158649, A164014, A343074, A369470, A369607.

A369470 a(n) = number of integer solutions to 1 <= x1 <= x2 <= ... <= xn to 1/x1 + ... + 1/xn = (1 - 1/x1) * ... * (1 - 1/xn).

Original entry on oeis.org

1, 1, 2, 35, 455, 13624, 1176579

Offset: 1

Max Alekseyev, Jan 23 2024

For any n, a(n) >= A369469(n) >= 1 (see A369607).

Max Muller et al., The diophantine equation \sum_{n=1}^{N} \frac{1}{x_{n}} = \prod_{k=1}^{N} \left(1-\frac{1}{x_{k}} \right), MathOverflow, 2024.

Cf. A002966, A007850, A054377, A085098, A118086, A158649, A164014, A342267, A348625, A369469, A369607.

A075461 List of solutions to the Znám problem sorted first by length, then lexicographically.

Original entry on oeis.org

2, 3, 7, 47, 395, 2, 3, 11, 23, 31, 2, 3, 7, 43, 1823, 193667, 2, 3, 7, 47, 403, 19403, 2, 3, 7, 47, 415, 8111, 2, 3, 7, 47, 583, 1223, 2, 3, 7, 55, 179, 24323, 2, 3, 7, 43, 1807, 3263447, 2130014000915, 2, 3, 7, 43, 1807, 3263591, 71480133827, 2, 3, 7, 43

Offset: 1

Eric W. Weisstein, Sep 16 2002

			Starts with A075441(5)=2 5-term solutions 2,3,7,47,395; 2,3,11,23,31, followed by A075441(6)=5 6-term solutions, etc.

Max Alekseyev, Table of n, a(n) for n = 1..934 (flattened list of the n-term solutions for n = 5..8)
J. Janák and L. Skula, On the integers xi for which xi | x1 . . . xi-1 xi . . . xn + 1 holds, Mathematica Slovaca, Vol. 28 (1978), No. 3, 305--310.
J. Sondow and K. MacMillan, Primary pseudoperfect numbers, arithmetic progressions, and the Erdos-Moser equation, Amer. Math. Monthly, 124 (2017) 232-240; arXiv:math/1812.06566 [math.NT], 2018.
Eric Weisstein's World of Mathematics, Znám's Problem
Wikipedia, Znám's problem.

Cf. A006585, A007850, A054377, A075441, A085098, A118086, A158649, A164014, A343074, A369469.

Edited by Max Alekseyev, Jan 25 2024

A225808 Values (Sum_{1<=i<=k} x_i)^2 = Sum_{1<=i<=k} x_i^3 for 1 <= x_1 <= x_2 <=...<= x_k ordered lexicographically according to (x1, x2,..., xk).

Original entry on oeis.org

1, 9, 16, 36, 81, 81, 100, 144, 256, 169, 225, 324, 361, 625, 144, 256, 324, 441, 324, 361, 441, 625, 256, 576, 729, 784, 576, 729, 900, 961, 1089, 1296, 484, 625, 784, 900, 484, 441, 576, 729, 784, 900, 1089, 1089, 1156, 1369, 625, 784, 729, 900, 1089, 1369, 1296, 1600, 900, 961, 1089

Offset: 1

Charles R Greathouse IV, Jimmy Zotos, and Balarka Sen, Jul 29 2013

a(n) <= k^4 where k is the size of the ordered tuple (x_1, x_2,..., x_k).

This sequence is closed under multiplication, that is, if m and n are in this sequence, so is m*n.

			1;
9, 16;
36, 81;
81, 100, 144, 256;
169, 225, 324, 361, 625;
144, 256, 324, 441, 324, 361, 441, 625, 256, 576, 729, 784, 576, 729, 900, 961, 1089, 1296;
484, 625, 784, 900, 484, 441, 576, 729, 784, 900, 1089, 1089, 1156, 1369, 625, 784, 729, 900, 1089, 1369, 1296, 1600, 900, 961, 1089, 1600, 1296, 1600, 2025, 2401;

Balarka Sen, Rows n = 1..10 of irregular triangle, flattened
Edward Barbeau and Samer Seraj, Sum of cubes is square of sum, arXiv:1306.5257 [math.NT], 2013.
John Mason, Generalising 'sums of cubes equal to squares of sums', The Mathematical Gazette 85:502 (2001), pp. 50-58.
Alasdair McAndrew, A cute result relating to sums of cubes
David Pagni, 82.27 An interesting number fact, The Mathematical Gazette 82:494 (1998), pp. 271-273.
Balarka Sen, Table of rows, n = 1..10
W. R. Utz, The Diophantine Equation (x_1 + x_2 + ... + x_n)^2 = x_1^3 + x_2^3 + ... + x_n^3, Fibonacci Quarterly 15:1 (1977), pp. 14, 16. Part 1, part 2.

Cf. A158649, A055012, A118881.

row[n_] := Reap[Module[{v, m}, v = Table[1, {n}]; m = n^(4/3); While[ v[[-1]] < m, v[[1]]++; If[v[[1]] > m, For[i = 2, i <= m, i++, If[v[[i]] < m, v[[i]]++; For[j = 1, j <= i - 1, j++, v[[j]] = v[[i]]]; Break[]]]]; If[Total[v^3] == Total[v]^2, Sow[Total[v]^2]]]]][[2, 1]];
Array[row, 7] // Flatten (* Jean-François Alcover, Feb 23 2019, from PARI *)

row(n)=my(v=vector(n,i,1),N=n^(4/3)); while(v[#v]N,for(i=2, N,if(v[i]

A225819 Consider the set of n-tuples such that the sum of cubes of the elements is equal to square of their sum; sequence gives largest element in all such tuples.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 9, 10, 12, 14, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 42, 44, 46, 48, 51, 53, 55, 58, 60, 62, 65, 67, 70, 72, 75, 77, 80, 82, 85, 88, 90, 93, 96, 98, 101, 104, 106, 109, 112, 115, 117, 120, 123, 126, 129, 132, 134, 137, 140, 143, 146, 149, 152, 155

Offset: 1

Charles R Greathouse IV, Jimmy Zotos, and Balarka Sen, Jul 30 2013

nonn

Conjecture [Sen]: lim inf log_n a(n) >= 5/4.

			Call an n-multiset with the sum of cubes of the elements equal to square of their sum an n-SCESS.
a(6) = 7 since the only 6-SCESS with the largest element >= 7 are (2, 4, 4, 5, 5, 7), (3, 3, 3, 3, 5, 7), (3, 4, 5, 5, 6, 7), (3, 5, 5, 5, 6, 7) and (4, 5, 5, 6, 6, 7) and none have an element larger than 7.
a(7) = 9 since the only 7-SCESS with the largest element >= 9 are (4, 4, 4, 5, 5, 5, 9), (4, 5, 5, 5, 6, 6, 9) and (6, 6, 6, 6, 6, 6, 9) and none have an element larger than 9.
a(8) = 10 since the only 8-SCESS with the largest element >= 10 are (2, 5, 5, 5, 5, 5, 6, 10), (2, 6, 6, 6, 6, 6, 6, 10), (3, 4, 5, 5, 5, 6, 7, 10), (3, 4, 5, 5, 6, 6, 7, 10), (3, 5, 5, 5, 6, 7, 7, 10), (3, 6, 6, 6, 7, 7, 7, 10), (4, 4, 4, 4, 4, 4, 6, 10), (4, 4, 4, 4, 5, 5, 7, 10), (4, 5, 5, 6, 6, 7, 8, 10), (5, 5, 5, 7, 7, 7, 8, 10) and (6, 6, 6, 6, 6, 6, 9, 10) and none have an element larger than 10.

Balarka Sen, Table of n, a(n) for n = 1..500
John Mason, Generalising 'sums of cubes equal to squares of sums', The Mathematical Gazette 85:502 (2001), pp. 50-58.
W. R. Utz, The Diophantine Equation (x_1 + x_2 + ... + x_n)^2 = x_1^3 + x_2^3 + ... + x_n^3, Fibonacci Quarterly 15:1 (1977), pp. 14, 16. Part 1, part 2.

Cf. A158649, A225808.

a(n)=my(v=vector(n, i, 1), N=n^(4/3), m=n); while(v[#v]N, for(i=2, N, if(v[i]

n <= a(n) <= n^(4/3), see A158649.

A227847 Number of tuples (x_1, x_2, ..., x_n) with 1 <= x_1 <= x_2 <= ... <= x_n such that Sum_{i=1..n} x_i^3 = (Sum_{i=1..n} x_i)^2 and Sum_{i=1..n-1} x_i^3 + (x_n-1)^3 + (x_n+1)^3 = (Sum_{i=1..n-1} x_i + 2x_n)^2.

Original entry on oeis.org

0, 1, 1, 1, 2, 2, 2, 6, 10, 31, 77, 206, 568, 1704, 5037, 15554

Offset: 1

Jimmy Zotos, Aug 01 2013

An n-tuple meeting the first condition is called an n-SCESS ("sum of cubes equals square of sum").
In other words, a(n) is the number of tuples (x_1, x_2, ..., x_n) satisfying SCESS such that (x_1, x_2, ..., x_{n-1}, x_n - 1, x_n + 1) also satisfies SCESS. - Max Alekseyev, Mar 04 2025
x_1 + x_2 + ... + x_{n-1} = A152948(x_n). - Balarka Sen, Aug 01 2013

			a(3) = 1 since the only 3-SCESS is (1, 2, 3) for which the corresponding ordered tuple (1, 2, 2, 4) satisfy the SCESS property. (See Mason et al.)
a(5) = 2 since the only 5-SCESS are (1, 2, 2, 3, 5) and (3, 3, 3, 3, 6) for which the corresponding ordered tuples (1, 2, 2, 3, 4, 6) and (3, 3, 3, 3, 5, 7) satisfy the SCESS property.
a(8) = 6 since the only 8-SCESS are (1, 1, 2, 4, 5, 5, 5, 8), (1, 2, 2, 3, 4, 5, 6, 8), (2, 2, 4, 4, 6, 6, 6, 9), (2, 6, 6, 6, 6, 6, 6, 10), (3, 3, 3, 3, 5, 6, 7, 9) and (3, 5, 5, 5, 6, 7, 7, 10) for which the corresponding ordered tuples (1, 1, 2, 4, 5, 5, 5, 7, 9), (1, 2, 2, 3, 4, 5, 6, 7, 9), (2, 2, 4, 4, 6, 6, 6, 8, 10), (2, 6, 6, 6, 6, 6, 6, 9, 11), (3, 3, 3, 3, 5, 6, 7, 8, 10) and (3, 5, 5, 5, 6, 7, 7, 9, 11) satisfy the SCESS property.

Edward Barbeau and Samer Seraj, Sum of cubes is square of sum, arXiv:1306.5257 [math.NT], 2013.
John Mason, Generalising 'sums of cubes equal to squares of sums', The Mathematical Gazette 85:502 (2001), pp. 50-58.

Cf. A001055, A152948, A158649, A225819.

a(n)=my(v=vector(n, i, 1), N=n^(4/3), k); while(v[#v]N, for(i=2, N, if(v[i]Balarka Sen, Aug 01 2013 */

A001055(n) <= a(n) <= A158649(n). - Balarka Sen, Aug 01 2013

a(11)-a(15) from Balarka Sen, Aug 01 2013
a(16) from Balarka Sen, Aug 11 2013
Definition corrected by Max Alekseyev, Mar 04 2025

A245030 Divisors of 7^24 - 1.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 13, 15, 16, 18, 19, 20, 24, 25, 26, 30, 32, 36, 38, 39, 40, 43, 45, 48, 50, 52, 57, 60, 64, 65, 72, 73, 75, 76, 78, 80, 86, 90, 95, 96, 100, 104, 114, 117, 120, 129, 130, 144, 146, 150, 152, 156, 160, 171, 172, 180, 181, 190

Offset: 1

Bruno Berselli, Jul 10 2014

Number of divisors of k^24-1 for k = 2..10: 96 (2), 384 (3), 768 (4), 1152 (5), 512 (6), 16128 (7), 8192 (8), 14336 (9), 2048 (10).
The following 36 triangular numbers belong to this sequence: 1, 3, 6, 10, 15, 36, 45, 78, 120, 171, 190, 300, 325, 741, 780, 2080, 2628, 2850, 4560, 8256, 8385, 14706, 16290, 18528, 74691, 170820, 334153, 450775, 720600, 1664400, 4191960, 5915080, 8654880, 19068400, 1730160900, 23947653922570801800.
There are 50 divisors a(k) such that a(k) is divisible by k.
Sum( A000005(a(i))^3, i=1..16128 ) = sum( A000005(a(i)), i=1..16128 )^2, see Kordemsky in References and Barbeau et al. in Links section.

			191581231380566414400 = 2^6*3^2*5^2*13*19*43*73*181*193*409*1201.

Boris A. Kordemsky, The Moscow Puzzles: 359 Mathematical Recreations, C. Scribner's Sons (1972), Chapter XIII, Paragraph 349.

Michael De Vlieger, Table of n, a(n) for n = 1..16128
Edward Barbeau and Samer Seraj, Sum of Cubes is Square of Sum, arXiv:1306.5257 [math.NT]
Index entries for sequences related to divisors of numbers

Cf. A000005, A158649, A245027.

Mathematica
```
Divisors[7^24 - 1]
```
PARI
```
divisors(7^24-1)
```

cp's OEIS Frontend

A018253 Divisors of 24.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Mathematica

PARI

Sage

Formula

A018255 Divisors of 30.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A369469 a(n) = number of integer solutions to 1 <= x1 < x2 < ... < xn to 1/x1 + ... + 1/xn = (1 - 1/x1) * ... * (1 - 1/xn).

Views

Author

Keywords

Comments

Links

Crossrefs

A369470 a(n) = number of integer solutions to 1 <= x1 <= x2 <= ... <= xn to 1/x1 + ... + 1/xn = (1 - 1/x1) * ... * (1 - 1/xn).

Views

Author

Keywords

Comments

Links

Crossrefs

A075461 List of solutions to the Znám problem sorted first by length, then lexicographically.

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

A225808 Values (Sum_{1<=i<=k} x_i)^2 = Sum_{1<=i<=k} x_i^3 for 1 <= x_1 <= x_2 <=...<= x_k ordered lexicographically according to (x1, x2,..., xk).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A225819 Consider the set of n-tuples such that the sum of cubes of the elements is equal to square of their sum; sequence gives largest element in all such tuples.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A227847 Number of tuples (x_1, x_2, ..., x_n) with 1 <= x_1 <= x_2 <= ... <= x_n such that Sum_{i=1..n} x_i^3 = (Sum_{i=1..n} x_i)^2 and Sum_{i=1..n-1} x_i^3 + (x_n-1)^3 + (x_n+1)^3 = (Sum_{i=1..n-1} x_i + 2x_n)^2.

Views

Author

Keywords

Comments

Examples