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.
a(1) = 5 because there are 5 primes of the form b^2+3 for b <= 10: 3, 7, 19, 67 and 103.
{a(n) = sum(k=0, 10^n, isprime(k^2+3))}
a(1) = 5 because there are 5 primes of the form b^2-2 for b <= 10 : 2, 7, 23, 47 and 79.
{a(n) = sum(k=0, 10^n, isprime(k^2-2))}
from sympy import isprime
def aupton(terms):
s, alst = 0, []
for n in range(1, terms+1):
s += sum(isprime(b**2-2) for b in range(10**(n-1), 10**n))
alst.append(s)
return alst
print(aupton(6)) # Michael S. Branicky, May 26 2021
a(1) = 3 because there are 3 primes of the form b^2-3 for b <= 10 : 13, 61 and 97.
{a(n) = sum(k=0, 10^n, isprime(k^2-3))}
Comments