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

A263098 a(n) = Max( tau(k) : k=1,2,3,...,n^2 ) where tau(k) = A000005(k) is the number of divisors of k.

Original entry on oeis.org

1, 3, 4, 6, 8, 9, 10, 12, 12, 12, 16, 16, 16, 18, 18, 20, 20, 20, 24, 24, 24, 24, 24, 24, 24, 24, 30, 30, 32, 32, 32, 32, 32, 32, 32, 36, 36, 36, 36, 36, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 72
Offset: 1

Views

Author

Antti Karttunen, Oct 10 2015

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Max[DivisorSigma[0, #] & /@ Range[n^2]], {n, 101}] (* Michael De Vlieger, Oct 11 2015 *)
  • PARI
    A070319(n, m=1, s=2)={for(k=s, n, mM. F. Hasler, Sep 12 2012
    A263098 = n -> A070319(n^2); \\ Slow without memoization.
    for(n=1, 2080, write("b263098.txt", n, " ", A263098(n)));
    
  • Scheme
    (define (A263098 n) (A070319 (A000290 n)))

Formula

a(n) = A070319(A000290(n)).

A263096 Square roots of highly composite numbers, floored down: a(n) = A000196(A002182(n)).

Original entry on oeis.org

1, 1, 2, 2, 3, 4, 6, 6, 7, 10, 13, 15, 18, 26, 28, 35, 40, 50, 70, 86, 100, 122, 141, 158, 166, 212, 224, 235, 288, 332, 407, 470, 526, 576, 706, 744, 815, 848, 1039, 1200, 1470, 1697, 1898, 2079, 2546, 2684, 2940, 3287, 3796, 4158, 4649, 5694, 6062, 6575, 7826, 8573, 10500, 11068, 12125, 13556, 15653, 17147, 19172, 23480, 26426, 27113, 33206, 37373, 45772, 46961, 48248, 52853, 59092, 68233, 74746, 83568, 102350
Offset: 1

Views

Author

Antti Karttunen, Oct 10 2015

Keywords

Comments

a(n) = number of strictly positive squares <= A002182(n).

Crossrefs

Programs

Formula

a(n) = A000196(A002182(n)).
Showing 1-2 of 2 results.