A107741 Smallest number m such that prime(n) = m + (digit sum of m), a(n)=0 if no such m exists.

1, 0, 0, 0, 10, 11, 13, 14, 16, 19, 0, 32, 34, 35, 37, 0, 52, 53, 56, 58, 59, 71, 73, 76, 0, 91, 92, 94, 95, 97, 122, 124, 127, 128, 142, 143, 146, 149, 160, 163, 166, 167, 181, 182, 184, 185, 0, 215, 217, 218, 0, 232, 233, 238, 250, 253, 256, 257, 0, 271

Offset: 1

Author

Reinhard Zumkeller, May 23 2005

Keywords

• nonn
• base

Comments

If a(n)>0 then: A000040(n)=A062028(a(n)) and A107740(n)>0.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A047791, A048521.

Cf. A000040, A055642, A062028.

Programs

Haskell

a107741 n = if null ms then 0 else head ms  where
   ms = [m | let p = a000040 n,
             m <- [max 0 (p - 9 * a055642 p) .. p - 1], a062028 m == p]
-- Reinhard Zumkeller, Sep 27 2014

Extensions

Data error corrected by Reinhard Zumkeller, Sep 27 2014