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.

Previous Showing 11-12 of 12 results.

A347160 Sum of 4th powers of distinct prime divisors of n that are <= sqrt(n).

Original entry on oeis.org

0, 0, 0, 16, 0, 16, 0, 16, 81, 16, 0, 97, 0, 16, 81, 16, 0, 97, 0, 16, 81, 16, 0, 97, 625, 16, 81, 16, 0, 722, 0, 16, 81, 16, 625, 97, 0, 16, 81, 641, 0, 97, 0, 16, 706, 16, 0, 97, 2401, 641, 81, 16, 0, 97, 625, 2417, 81, 16, 0, 722, 0, 16, 2482, 16, 625, 97, 0, 16, 81, 3042
Offset: 1

Views

Author

Ilya Gutkovskiy, Aug 20 2021

Keywords

Crossrefs

Programs

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

Formula

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

A382486 Product of distinct prime divisors of n that are <= sqrt(n).

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 5, 2, 3, 2, 1, 30, 1, 2, 3, 2, 5, 6, 1, 2, 3, 10, 1, 6, 1, 2, 15, 2, 1, 6, 7, 10, 3, 2, 1, 6, 5, 14, 3, 2, 1, 30, 1, 2, 21, 2, 5, 6, 1, 2, 3, 70, 1, 6, 1, 2, 15, 2, 7, 6, 1, 10, 3, 2, 1, 42, 5
Offset: 1

Views

Author

Ilya Gutkovskiy, Apr 10 2025

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Times @@ Select[Divisors[n], PrimeQ[#] && # <= Sqrt[n] &], {n, 1, 85}]
  • PARI
    a(n) = vecprod(select(x->x<=sqrt(n), factor(n)[,1])); \\ Michel Marcus, Apr 17 2025

Formula

a(p) = 1, for prime p.
Previous Showing 11-12 of 12 results.