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.

A346644 Least k >= 1 such that sigma(k)/tau(k) has denominator n or zero if no k exists.

Original entry on oeis.org

1, 2, 4, 8, 16, 450, 64, 128, 36, 162, 1024, 1800, 4096, 1458, 144, 32768, 65536, 54450, 262144, 405000, 576, 118098, 4194304, 28800, 1296, 1062882, 900, 5832, 268435456, 115200, 1073741824, 2147483648, 9216, 86093442, 5184, 217800, 68719476736, 774840978, 102400
Offset: 1

Views

Author

Benoit Cloitre, Jul 26 2021

Keywords

Comments

Conjecture: k always exists.

Crossrefs

Programs

  • Mathematica
    seq[max_] := Module[{s = Table[0,{max}], c = 0, n = 1}, While[c < max, d = Denominator[DivisorSigma[1,n]/DivisorSigma[0,n]]; If[d <= max && s[[d]] == 0, c++; s[[d]] = n]; n++]; s]; seq[22] (* Amiram Eldar, Jul 26 2021 *)
  • PARI
    a(n)=if(n<0, 0, t=1; while(denominator(sigma(t)/numdiv(t))!=n, t++); t)

Extensions

a(29)-a(36) from Amiram Eldar, Jul 26 2021
a(37) from David A. Corneth, Jul 26 2021
a(38)-a(39) from Jinyuan Wang, Jul 26 2021