A247797 Lexicographically earliest permutation of prime numbers, such that adjacent terms have coprime sums of digits in decimal representation.

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

Offset: 1

Author

Reinhard Zumkeller, Nov 25 2014

Keywords

• nonn
• base

Comments

A049084(a(n)) defines a permutation of the positive integers, cf. A250552.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
• Christian Mauduit and Joël Rivat, Sur un problème de Gelfond: la somme des chiffres des nombres premiers, Annals of Mathematics, Vol. 171, No. 3, 1591-1646, 2010.

Crossrefs

Cf. A000040, A007953, A007605, A049084, A250552, A119449, A119450.

Programs

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