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.

A348695 a(n) is the least number k such that the denominator of the harmonic mean of the divisors of k is equal to n, or -1 if no such k exists.

This page as a plain text file.
%I A348695 #11 Oct 30 2021 10:41:56
%S A348695 1,3,2,7,24,11,4,21,10,19,258,23,9,39,8,31,402,55,37,57,26,43,3836,47,
%T A348695 216,99,34,124,4844,59,16,93,86,67,76,71,73,111,125,79,978,83,7196,
%U A348695 129,58,411,7868,155,52,447,101,63,1266,107,109,372,74,519,9884,203
%N A348695 a(n) is the least number k such that the denominator of the harmonic mean of the divisors of k is equal to n, or -1 if no such k exists.
%H A348695 Amiram Eldar, <a href="/A348695/b348695.txt">Table of n, a(n) for n = 1..1000</a>
%e A348695 a(2) = 3 since the harmonic mean of the divisors of 3 is 3/2.
%e A348695 a(3) = 2 since the harmonic mean of the divisors of 2 is 4/3.
%t A348695 den[n_] := Denominator[DivisorSigma[0, n]/DivisorSigma[-1, n]]; seq[m_] := Module[{s = Table[0, {m}], c = 0, n = 1, i}, While[c < m, i = den[n]; If[i <= m && s[[i]] == 0, c++; s[[i]] = n]; n++]; s]; seq[100]
%Y A348695 Cf. A099377, A099378, A348694.
%K A348695 nonn
%O A348695 1,2
%A A348695 _Amiram Eldar_, Oct 30 2021