login
A082785
Number of ways n can be written as the sum of a brilliant number and a prime.
1
0, 0, 0, 0, 0, 1, 1, 1, 2, 0, 3, 2, 2, 1, 2, 2, 5, 1, 2, 2, 3, 2, 4, 1, 2, 3, 4, 4, 2, 1, 1, 4, 3, 2, 2, 1, 3, 5, 1, 3, 2, 2, 2, 3, 2, 3, 3, 2, 1, 2, 4, 5, 2, 3, 1, 4, 3, 3, 1, 1, 1, 5, 2, 2, 2, 3, 2, 5, 1, 1, 2, 3, 2, 2, 2, 3, 3, 3, 1, 3, 2, 4, 2, 1, 2, 3, 2, 4, 2, 1, 0, 4, 3, 3, 1, 3, 1, 3, 1, 1, 1, 2, 2, 3, 1
OFFSET
1,9
EXAMPLE
a(17) = 5 because 17 = 4+13 = 6+11 = 10+7 = 14+3 = 15+2.
CROSSREFS
Cf. A078972.
Sequence in context: A221879 A171934 A303205 * A100949 A152164 A263112
KEYWORD
nonn
AUTHOR
Jason Earls, Jun 26 2003
STATUS
approved