|
Search: id:A052999
|
|
|
| A052999 |
|
Take n-th prime p, let P = all primes that can be obtained by permuting the digits of p and possibly adding or 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, 90, 18, 54, 90, 1980, 199980, 18, 36, 360, 3960, 3960, 450, 450, 540, 540, 36, 36, 18, 0, 720, 18, 90, 72, 36, 90, 18, 144, 18, 36, 54, 270, 900, 414, 450, 450, 36, 18, 630, 720, 54, 18, 720, 810, 1980, 1800, 1800, 2790, 54, 180, 270, 20250, 1800, 1800, 144
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
EXAMPLE
|
a(6)=18 since 6th prime is 13 and 31-13=18. a(9)=1980 because 9th prime is 23 and the smallest prime in P different from 23 is 2003; 2003-23=1980.
|
|
CROSSREFS
|
Cf. A052902, A052998, A053544, A052495, A052484.
Sequence in context: A093405 A058631 A078293 this_sequence A050662 A033410 A008901
Adjacent sequences: A052996 A052997 A052998 this_sequence A053000 A053001 A053002
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 16 2000
|
|
EXTENSIONS
|
More terms from Asher Natan Auel (auela(AT)reed.edu), May 12, 2000
|
|
|
Search completed in 0.002 seconds
|
