id:A052902 - OEIS Search Results

Search: id:A052902

Displaying 1-1 of 1 results found.

page 1

Take n-th prime p, let P = all primes that can be obtained by permuting the digits of p and possibly omitting zeros; a(n) = |p-q| where q in P is the closest to p but different from p (a(n)=0 if no such q exists).

+0
6

0, 0, 0, 0, 0, 18, 54, 0, 0, 0, 18, 36, 0, 0, 0, 0, 0, 0, 0, 54, 36, 18, 0, 0, 18, 90, 72, 36, 90, 18, 144, 18, 36, 54, 270, 0, 414, 450, 450, 36, 18, 630, 720, 54, 18, 720, 0, 0, 0, 0, 0, 54, 180, 270, 0, 0, 0, 144, 450, 540, 540, 54, 234, 180, 18, 144, 18, 36, 396, 90, 0, 234, 306 (list; graph; listen)

	OFFSET	`1,6`
	EXAMPLE	`a(6)=18 since 6th prime is 13 and 31-13=18. a(25)=90 since 23rd prime is 101 and 101-11=90.`
	CROSSREFS	`Cf. A052998, A052999, A053544, A052495.` `Sequence in context: A126372 A133356 A052495 this_sequence A059137 A096011 A068396` `Adjacent sequences: A052899 A052900 A052901 this_sequence A052903 A052904 A052905`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`njas, Mar 16 2000`
	EXTENSIONS	`More terms from Asher Natan Auel (auela(AT)reed.edu), May 12, 2000`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research