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.

A024676 a(n) is the number of prime divisors (counted by multiplicity) of A024675(n).

Original entry on oeis.org

2, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 4, 4, 6, 2, 5, 3, 4, 2, 2, 3, 3, 3, 5, 2, 5, 2, 2, 3, 6, 4, 3, 6, 3, 3, 5, 5, 3, 7, 3, 4, 2, 2, 4, 4, 3, 3, 6, 3, 2, 4, 3, 5, 2, 3, 3, 7, 5, 2, 5, 4, 6, 2, 4, 4, 4, 3, 3, 3, 4, 2, 2, 2, 3, 5, 4, 5, 3, 7, 3, 4, 2, 2, 4, 4, 3, 2, 3, 2, 4, 2, 3, 2, 4, 4, 6
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Maple
    seq(numtheory:-bigomega((ithprime(n+1)+ithprime(n+2))/2), n=1..100); # Robert Israel, Jan 22 2024

Formula

a(n) = A001222(A024675(n)).

Extensions

Edited by Robert Israel, Jan 22 2024