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

A299788 a(n) = denominator of Product_{d|n} (sigma(d)/d) where sigma(k) = the sum of the divisors of k (A000203).

Original entry on oeis.org

1, 2, 3, 8, 5, 1, 7, 64, 27, 25, 11, 3, 13, 49, 25, 1024, 17, 27, 19, 1000, 441, 121, 23, 16, 125, 169, 729, 7, 29, 625, 31, 32768, 121, 289, 1225, 5832, 37, 361, 1521, 6400, 41, 2401, 43, 1331, 3375, 529, 47, 3072, 343, 31250, 289, 17576, 53, 6561, 3025, 49
Offset: 1

Views

Author

Jaroslav Krizek, Jan 21 2019

Keywords

Examples

			For n=4; Product_{d|4} (sigma(d)/d) = (sigma(1)/1)*(sigma(2)/2)*(sigma(4)/4) = (1/1)*(3/2)*(7/4) = 21/8; a(4) = 8.
		

Crossrefs

Cf. A000203, A318491, A318492, A322673 (numerator).

Programs

  • Magma
    [Denominator(&*[&+[c: c in Divisors(d)] / d: d in Divisors(n)]): n in [1..100]];
    
  • Mathematica
    Array[Denominator@ Product[DivisorSigma[1, d]/d, {d, Divisors@ #}] &, 51]
  • PARI
    a(n) = my(p=1); fordiv(n, d, p *= sigma(d)/d); denominator(p); \\ Michel Marcus, Jan 21 2019

Formula

a(n) = 1 for n = 1, 6, ... (no other n <= 5*10^6).
a(n) = n for n = primes (A000040).
a(n) = n * sqrt(n) for n in A280076 (union of 1 and squares of primes (A001248)).
Showing 1-1 of 1 results.