id:A094235 - OEIS Search Results

Search: id:A094235

Displaying 1-1 of 1 results found.

page 1

Number of ways n can be written as the sum of a prime and a palindrome.

+0
1

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 (list; graph; listen)

	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: A057142 A098388 A157792 this_sequence A156876 A137397 A062571` `Adjacent sequences: A094232 A094233 A094234 this_sequence A094236 A094237 A094238`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), May 30 2004`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research