A093993 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A093993

Number of divisors of n with a prime digital sum.

0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 0, 3, 2, 2, 0, 2, 0, 3, 3, 2, 1, 3, 2, 1, 1, 3, 1, 4, 0, 3, 2, 2, 2, 3, 0, 2, 1, 3, 1, 5, 1, 2, 2, 2, 1, 4, 2, 4, 1, 2, 0, 2, 2, 4, 1, 3, 0, 6, 1, 1, 3, 3, 2, 3, 1, 2, 2, 5, 0, 3, 0, 2, 3, 3, 2, 2, 0, 4, 1, 2, 1, 6, 2, 2, 2, 2, 1, 4, 1, 3, 1, 3, 1, 5, 0, 5, 2, 5, 1, 4, 0, 3, 4

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,6

LINKS

Table of n, a(n) for n=1..105.

EXAMPLE

a(12)=3 because the divisors of 12 are: [1, 2, 3, 4, 6, 12] and 2, 3 and 1+2=3 are primes.

a(98)=5 because the divisors of 98 are: [1, 2, 7, 14, 49, 98] and 2, 7, 1+4=5, 4+9=13 and 9+8=17 are primes.

CROSSREFS

Sequence in context: A002951 A331287 A365105 * A193073 A228100 A211992

Adjacent sequences: A093990 A093991 A093992 * A093994 A093995 A093996

KEYWORD

base,easy,nonn

AUTHOR

Jason Earls, May 24 2004

STATUS

approved