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.

A110742 Number of primes with digit sum n having at most n digits.

Original entry on oeis.org

0, 2, 1, 8, 27, 0, 211, 500, 0, 5404, 23137, 0, 269736, 806856, 0, 10508986, 43103947, 0
Offset: 1

Views

Author

Amarnath Murthy, Aug 10 2005

Keywords

Comments

a(3n) = 0 for n > 1.
The binary version of this sequence is the characteristic function of A000043. [David Wasserman, Dec 17 2008]

Examples

			For a(2) the two primes are 2 and 11. 101 is not included because it has 3 digits.
		

Crossrefs

Cf. A110741.

Programs

  • PARI
    f(n, i, left, num) = if (i == n - 1, return(left <= 9 && isprime(num + left*10^i))); sum(j = 0, min(left, 9), f(n, i + 1, left - j, num + j*10^i));
    a(n) = f(n, 0, n, 0); \\ David Wasserman, Dec 17 2008

Extensions

a(7)-a(10) from Donovan Johnson, Mar 23 2008
More terms from David Wasserman, Dec 17 2008