|
|
A247797
|
|
Lexicographically earliest permutation of prime numbers, such that adjacent terms have coprime sums of digits in decimal representation.
|
|
2
|
|
|
2, 3, 5, 7, 11, 23, 13, 29, 17, 41, 31, 43, 19, 47, 37, 61, 53, 67, 59, 83, 71, 89, 73, 137, 79, 113, 97, 131, 101, 139, 103, 151, 107, 157, 109, 173, 127, 179, 149, 191, 163, 193, 167, 197, 181, 199, 211, 223, 227, 229, 233, 241, 251, 263, 239, 269, 257
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A049084(a(n)) defines a permutation of the positive integers, cf. A250552.
|
|
REFERENCES
|
C. Mauduit, J. Rivat: Sur un problème de Gelfond: la somme des chiffres des nombres premiers, Annals of Mathematics, Vol. 171, No. 3, 1591-1646, 2010
|
|
LINKS
|
|
|
PROG
|
(Haskell)
import Data.List (delete)
a247797 n = a247797_list !! (n-1)
a247797_list = f 1 $ zip a000040_list a007605_list where
f q' vws = g vws where
g ((p, q):pqs) = if gcd q q' == 1
then p : f q (delete (p, q) vws) else g pqs
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|