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

A347526 Number of divisors of n that are at most n^(1/4).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3
Offset: 1

Views

Author

Seiichi Manyama, Sep 05 2021

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := DivisorSum[n, 1 &, # <= n^(1/4) &]; Array[a, 100] (* Amiram Eldar, Sep 05 2021 *)
  • PARI
    a(n) = sumdiv(n, d, d^4<=n);
    
  • PARI
    N=99; x='x+O('x^N); Vec(sum(k=1, N^(1/4), x^k^4/(1-x^k)))

Formula

G.f.: Sum_{k>=1} x^(k^4)/(1 - x^k).
Showing 1-1 of 1 results.