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.

A174900 a(n) = the smallest numbers k such that A007955(k) = n, or 0 if there is no such k, where A007955(m) = product of divisors of m.

Original entry on oeis.org

1, 2, 3, 0, 5, 0, 7, 4, 0, 0, 11, 0, 13, 0, 0, 0, 17, 0, 19, 0, 0, 0, 23, 0, 0, 0, 9, 0, 29, 0, 31, 0, 0, 0, 0, 6, 37, 0, 0, 0, 41, 0, 43, 0, 0, 0, 47, 0, 0, 0, 0, 0, 53, 0, 0, 0, 0, 0, 59, 0, 61, 0, 0, 8, 0, 0, 67, 0, 0, 0, 71, 0, 73, 0, 0, 0, 0, 0, 79, 0, 0, 0, 83
Offset: 1

Views

Author

Jaroslav Krizek, Apr 01 2010

Keywords

Comments

a(n) = the largest numbers k such that A007955 (k) = n, or 0 if there is no such k.

Crossrefs

Cf. A007955.

Programs

  • Mathematica
    With[{m = 100}, s[n_] := n^(DivisorSigma[0, n]/2); (FirstPosition[Array[s, m], #] & /@ Range[m]) /. Missing["NotFound"] -> 0 // Flatten] (* Amiram Eldar, Aug 06 2024 *)

Extensions

More terms from Amiram Eldar, Aug 06 2024