id:A099191 - OEIS Search Results

Search: id:A099191

Displaying 1-1 of 1 results found.

page 1

Smallest prime p such that p+n is twice its reversal, or 0 if impossible.

+0
1

73, 2, 3, 0, 5, 0, 7, 0, 0, 0, 11, 0, 211, 0, 0, 0, 53, 0, 613, 0, 0, 0, 0, 0, 43, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 23, 0, 241, 0, 0, 0, 0, 0, 13, 0, 0, 0, 251, 0, 0, 0, 0, 0, 653, 0, 97, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 271, 0, 0, 0, 0, 0, 673, 0, 0, 0, 281, 0, 67, 0, 0, 0, 683, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a(13) = 211 since 211+13 = 224 = 2112. a(25) = 43 since 25+43 = 68 = 234.`
	MATHEMATICA	`f[n_] := Block[{k = 1}, While[p = Prime[k]; p + n != 2FromDigits[ Reverse[ IntegerDigits[ p]]] && k < 10^6, k++ ]; If[k == 10^6, 0, Prime[k]]]; Table[ f[n], {n, 75}]`
	CROSSREFS	`Cf. A099190.` `Sequence in context: A135427 A028671 A113889 this_sequence A051325 A102050 A057446` `Adjacent sequences: A099188 A099189 A099190 this_sequence A099192 A099193 A099194`
	KEYWORD	`base,nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 01 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research