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.

A334019 Sum of unitary divisors of n that are smaller than sqrt(n).

Original entry on oeis.org

0, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 4, 1, 3, 4, 1, 1, 3, 1, 5, 4, 3, 1, 4, 1, 3, 1, 5, 1, 11, 1, 1, 4, 3, 6, 5, 1, 3, 4, 6, 1, 12, 1, 5, 6, 3, 1, 4, 1, 3, 4, 5, 1, 3, 6, 8, 4, 3, 1, 13, 1, 3, 8, 1, 6, 12, 1, 5, 4, 15, 1, 9, 1, 3, 4, 5, 8, 12, 1, 6, 1, 3, 1, 15, 6
Offset: 1

Views

Author

Amiram Eldar, Apr 12 2020

Keywords

Examples

			The unitary divisors of 12 are {1, 3, 4, 12}, 1 and 3 are smaller than sqrt(12) and their sum is 1 + 3 = 4, hence a(12) = 4.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := DivisorSum[n, # &, #^2 < n && CoprimeQ[#, n/#] &]; Array[a, 100]
  • PARI
    a(n) = sumdiv(n, d, if(gcd(d, n/d)==1 && dJinyuan Wang, Apr 12 2020

Formula

a(n) = A070039(n) for squarefree numbers (A005117) or squares of primes (A001248).