|
Search: id:A093993
|
|
|
| A093993 |
|
Number of divisors of n with a prime digital sum. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,6
|
|
|
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: A002339 A074807 A002951 this_sequence A123529 A140747 A066952
Adjacent sequences: A093990 A093991 A093992 this_sequence A093994 A093995 A093996
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), May 24 2004
|
|
|
Search completed in 0.002 seconds
|
