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-2 of 2 results.

A279081 Number of divisors of the n-th tetrahedral number.

Original entry on oeis.org

1, 3, 4, 6, 4, 8, 12, 16, 8, 12, 8, 12, 8, 20, 16, 20, 8, 24, 16, 24, 8, 16, 18, 24, 18, 36, 24, 24, 8, 24, 20, 24, 16, 48, 32, 24, 8, 32, 24, 32, 8, 24, 32, 48, 16, 20, 24, 45, 18, 36, 16, 36, 24, 96, 48, 32, 8, 24, 16, 24, 16, 56, 96, 56, 16, 24, 16, 48, 16
Offset: 1

Views

Author

Jon E. Schoenfield, Jan 06 2017

Keywords

Comments

The n-th tetrahedral number is A000292(n) = n*(n+1)*(n+2)/6. The only odd-valued terms are a(1)=1, a(2)=3, and a(48)=45, corresponding to the only nonzero tetrahedral numbers that are also square, i.e., A000292(1)=1, A000292(2)=4, and A000292(48)=19600.
We can write n*(n+1)*(n+2)/6 as the product of three pairwise coprime integers A, B, and C as follows, depending on the value of n mod 12:
.
n mod 12 A B C factor that can be even
======== === ======= ======= =======================
0 n/3 n+1 (n+2)/2 A
1 n (n+1)/2 (n+2)/3 B
2 n/2 (n+1)/3 n+2 C
3 n/3 (n+1)/2 n+2 B
4 n n+1 (n+2)/6 A
5 n (n+1)/6 n+2 B
6 n/6 n+1 n+2 C
7 n (n+1)/2 (n+2)/3 B
8 n (n+1)/3 (n+2)/2 A
9 n/3 (n+1)/2 n+2 B
10 n/2 n+1 (n+2)/3 C
11 n (n+1)/6 n+2 B
.
For all n > 6, A, B, and C are all greater than 1 and share no prime factors, so their product must contain at least three distinct prime factors; consequently, its number of divisors cannot be prime or semiprime. The only semiprimes in this sequence are a(3), a(4), and a(5), and the only prime is a(2).

Examples

			a(48) = tau(48*59*50/6) = tau(19600) = tau(2^4 * 5^2 * 7^2) = (4+1)*(2+1)*(2+1) = 5*3*3 = 45.
		

Crossrefs

Programs

  • Maple
    with(numtheory): seq(tau(n*(n+1)*(n+2)/6), n=1..70) ; # Ridouane Oudra, Jan 25 2024
  • Mathematica
    DivisorSigma[0, Binomial[Range[100]+2, 3]] (* Paolo Xausa, Feb 19 2024 *)
  • PARI
    a(n) = numdiv(n*(n+1)*(n+2)/6); \\ Michel Marcus, Jan 07 2017

Formula

a(n) = A000005(A000292(n)) = A000005(n*(n+1)*(n+2)/6).
From Ridouane Oudra, Jan 25 2024: (Start)
a(6*n) = tau(2*n)*tau(6*n+1)*tau(6*n+2)/2;
a(6*n+1) = tau(6*n+1)*tau(3*n+1)*tau(2*n+1);
a(6*n+2) = tau(6*n+2)*tau(2*n+1)*tau(6*n+4)/2;
a(6*n+3) = tau(2*n+1)*tau(3*n+2)*tau(6*n+5);
a(6*n+4) = tau(6*n+4)*tau(6*n+5)*tau(2*n+2)/2;
a(6*n+5) = tau(6*n+5)*tau(n+1)*tau(6*n+7). (End)

A279082 Smallest tetrahedral number with exactly n divisors, or 0 if no such number exists.

Original entry on oeis.org

1, 0, 4, 10, 0, 20, 0, 56, 0, 0, 0, 84, 0, 0, 0, 120, 0, 2300, 0, 560, 0, 0, 0, 1140, 0, 0, 0, 349504, 0, 2362041, 0, 7770, 0, 0, 0, 3276, 0, 0, 0, 82160, 0, 0, 0, 4980598206895701865797099599990718771851543594988165352649, 19600, 0, 0, 7140, 0, 0, 0, 91625967616, 0, 155965244802415621, 0, 41664, 0, 0, 0, 2332880, 0, 0, 0, 59640, 0
Offset: 1

Views

Author

Jon E. Schoenfield, Jan 06 2017, Jan 31 2021

Keywords

Comments

If the k-th tetrahedral number (i.e., A000292(k) = k*(k+1)*(k+2)/6) has exactly 42 divisors, it must be of the form p^6 * q^2 * r where p, q, and r are distinct primes, and it can be shown that p^6, q^2, and r must be k, (k+1)/2, and (k+2)/3, in some order. This results in six cases:
.
p^6 q^2 r resulting equations
======= ======= ======= ===========================
k (k+1)/2 (k+2)/3 p^6 = 2*q^2 - 1 = 3*r - 2
k (k+2)/3 (k+1)/2 p^6 = 3*q^2 - 2 = 2*r - 1
(k+1)/2 k (k+2)/3 2*p^6 = q^2 + 1 = 3*r - 1
(k+1)/2 (k+2)/3 k 2*p^6 = 3*q^2 - 1 = r + 1
(k+2)/3 k (k+1)/2 3*p^6 = q^2 + 2 = 2*r + 1
(k+2)/3 (k+1)/2 k 3*p^6 = 2*q^2 + 1 = r + 2
.
Cases 1 and 2 require p^6 + 1 = 2*q^2 and p^6 + 1 = 2*r, respectively, but both can be ruled out by factoring p^6 + 1 = (p^2 + 1)*(p^4 - p^2 + 1).
The four remaining cases require, respectively, the existence of a square of the form 2*p^6 - 1, (2*p^6 + 1)/3, 3*p^6 - 2, or (3*p^6 - 1)/2. An exhaustive search of the primes p up to 10^10 finds none that yields a square for any of those four forms, so if a(42) is not zero, then a(42) > (10^10)^18 / 6 = 1.666...*10^179.
Terms from a(66) through a(100): ?, 0, 375299968925696, 0, 0, 0, 215820, 0, 0, 0, 24019198012555264, 0, 0, 0, 88560, 0, 0, 0, 32016576, 0, 0, 0, 1431655424, 0, 2391444, 0, a(92), 0, 0, 0, 27720, 0, 0, 0, 40690000. (a(92), too large to show here, is p^22*((3*p^22 - 1)/2)*(3*p^22 - 2) where p = 10711.) [Updated by Max Alekseyev, Feb 03 2024]
Solutions to 2*p^6 = q^2 + 1 correspond to (some) integral points (X,Y) = (p^2, q) on the elliptic curve 2*X^3 = Y^2 + 1. All other cases for n = 42, as well as all the cases for n in {50, 70, 78, 98}, also correspond to elliptic curves, and I have computationally verified that all their integral points do not have the required form. Hence, a(42) = a(50) = a(70) = a(78) = a(98) = 0. - Max Alekseyev, Feb 03 2024

Crossrefs

Cf. A081978 (analogous sequence for triangular numbers).

Extensions

a(42)=a(50)=a(70)=a(78)=a(98)=0 from Max Alekseyev, Feb 03 2024
Showing 1-2 of 2 results.