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.

A076931 Smallest k such that n*k has n divisors.

Original entry on oeis.org

1, 1, 3, 2, 125, 2, 16807, 3, 4, 8, 2357947691, 5, 1792160394037, 32, 135, 24, 2862423051509815793, 10, 5480386857784802185939, 12, 1701, 512, 39471584120695485887249589623, 15, 400, 2048, 972, 48, 3053134545970524535745336759489912159909
Offset: 1

Views

Author

Amarnath Murthy, Oct 18 2002

Keywords

Comments

n=p_1^a_1*...*p_r^a_r => tau(p_1^(p_1^a_1-1)*...*p_r^(p_r^a_r-1))=n, so sequence is well-defined.

Crossrefs

a(n)= A073904(n)/n.

Programs

  • Mathematica
    f[n_] := Block[{k = 1, m = If[ PrimeQ[n], n^(n-2), 1]}, While[ DivisorSigma[0, k*m*n] != n, k++ ]; k*m]; Table[f[n], {n, 29}] (* Robert G. Wilson v, Sep 29 2005 *)

Formula

a(p)=p^(p-2), a(pq)=p^(q-2)*q^(p-2) for p

Extensions

More terms from Sascha Kurz, Jan 21 2003
More terms from David Wasserman, Aug 19 2005