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.

A347156 Sum of squares of distinct prime divisors of n that are < sqrt(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 4, 0, 4, 0, 4, 0, 13, 0, 4, 9, 4, 0, 13, 0, 4, 9, 4, 0, 13, 0, 4, 9, 4, 0, 38, 0, 4, 9, 4, 25, 13, 0, 4, 9, 29, 0, 13, 0, 4, 34, 4, 0, 13, 0, 29, 9, 4, 0, 13, 25, 53, 9, 4, 0, 38, 0, 4, 58, 4, 25, 13, 0, 4, 9, 78, 0, 13, 0, 4, 34, 4, 49, 13, 0, 29
Offset: 1

Views

Author

Ilya Gutkovskiy, Aug 20 2021

Keywords

Crossrefs

Programs

  • Mathematica
    Table[DivisorSum[n, #^2 &, # < Sqrt[n] && PrimeQ[#] &], {n, 1, 80}]
    nmax = 80; CoefficientList[Series[Sum[Prime[k]^2 x^(Prime[k] (Prime[k] + 1))/(1 - x^Prime[k]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest

Formula

G.f.: Sum_{k>=1} prime(k)^2 * x^(prime(k)*(prime(k) + 1)) / (1 - x^prime(k)).