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.

A349848 a(n) = Sum_{k=1..n} prime(n)^prime(k).

Original entry on oeis.org

4, 36, 3275, 840742, 285331320285, 304667330108466, 827250200736677741479, 1983900084687573008820254, 20880542756369384174903669400953, 2567686157477937962829648585022637187631942, 17086936018496343189927728440572423322828545911
Offset: 1

Views

Author

Firdous Ahmad Mala, Dec 02 2021

Keywords

Examples

			For n=3, p=5, a(n) = 5^2 + 5^3 + 5^5 = 25 + 125 + 3125 = 3275.
		

Programs

  • PARI
    a(n) = my(p=prime(n)); sum(k=1, n, p^prime(k)); \\ Michel Marcus, Dec 02 2021
    
  • Python
    from sympy import prime, primerange
    def a(n): pn = prime(n); return sum(pn**pk for pk in primerange(1, pn+1))
    print([a(n) for n in range(1, 12)]) # Michael S. Branicky, Dec 02 2021

Extensions

More terms from Michel Marcus, Dec 02 2021