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.

Showing 1-1 of 1 results.

A378123 a(n) = number of prime divisors of the sum of the first n odd primes.

Original entry on oeis.org

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

Views

Author

Clark Kimberling, Nov 17 2024

Keywords

Examples

			3+5+7+11+13 = 39 = 3*13, so a(5) = 2.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := PrimeNu[Total[Prime[1+Range[n]]]]; Array[a, 500]
  • PARI
    a378123(n)=omega(sum(k=2,n+1,prime(k))) \\ Hugo Pfoertner, Nov 19 2024

Formula

a(n) = A001221(A071148(n)).
Showing 1-1 of 1 results.