id:A096915 - OEIS Search Results

Search: id:A096915

Displaying 1-1 of 1 results found.

page 1

Smallest prime which when appended to n produces a prime.

+0
5

3, 3, 7, 3, 3, 7, 3, 3, 7, 3, 3, 7, 7, 23, 7, 3, 3, 11, 3, 11, 11, 3, 3, 11, 7, 3, 7, 3, 3, 7, 3, 17, 7, 7, 3, 7, 3, 3, 7, 13, 11, 11, 3, 3, 7, 3, 23, 7, 19, 3, 13, 3, 23, 7, 7, 3, 7, 7, 3, 7, 3, 11, 11, 3, 3, 19, 3, 3, 11, 13, 29, 7, 3, 3, 7, 43, 3, 7, 7, 11, 11, 3, 11, 19, 3, 3, 7, 3, 23, 7, 37, 41 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a(20)=11 because 11 is prime and 2011 is the smallest prime starting with 20 (2003 is not allowed).`
	MATHEMATICA	`f[n_] := Block[{p = 2, a = IntegerDigits[n]}, While[ !PrimeQ[ FromDigits[ Join[a, IntegerDigits[ Prime[p]]] ]], p++ ]; Prime[p]]; Table[ f[n], {n, 92}] (from Robert G. Wilson v Aug 20 2004)`
	CROSSREFS	`Cf. A088606.` `Adjacent sequences: A096912 A096913 A096914 this_sequence A096916 A096917 A096918` `Sequence in context: A076217 A089488 A076560 this_sequence A100803 A036840 A030316`
	KEYWORD	`nonn,base`
	AUTHOR	`Bodo Zinser (BodoZinser(AT)CosmoData.net), Aug 18 2004`
	EXTENSIONS	`More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 20 2004`

page 1

Search completed in 0.002 seconds

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.

AT&T Labs Research