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.

A373850 a(n) = A276085(n) mod bigomega(n), where bigomega (A001222) and A276085 are fully additive with a(p) = 1 and a(p) = p#/p respectively.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jun 20 2024

Keywords

Crossrefs

Cf. A001222, A276085, A373832 [= a(A276086(n))], A373851, A373852 (after its initial term, gives the indices of 0's).

Programs

  • PARI
    A276085(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*prod(i=1,primepi(f[k, 1]-1),prime(i))); };
    A373850(n) = (A276085(n)%bigomega(n));