login
A094235
Number of ways n can be written as the sum of a prime and a palindrome.
0
0, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 4, 5, 5, 3, 4, 3, 4, 4, 4, 3, 4, 3, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 3, 4, 4, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 5, 4, 4, 3, 3, 4, 5, 4, 4, 3, 4, 5, 5, 5, 4, 3, 4, 5, 5, 4, 4, 4, 5, 4, 4, 3, 3, 4, 5, 4, 4, 3, 4, 4, 3, 4, 3, 2, 4, 5, 4, 6, 6, 6
OFFSET
0,3
EXAMPLE
a(313)=9 because
313=31+282
313=41+272
313=61+252
313=71+242
313=101+212
313=269+44
313=307+6
313=311+2
313=313+0
CROSSREFS
Sequence in context: A157792 A171896 A341167 * A328003 A262558 A156876
KEYWORD
base,easy,nonn
AUTHOR
Jason Earls, May 30 2004
STATUS
approved