A113736 Let prime(0) = 1 and f(i) = sum prime(d), where d ranges over all the decimal digits of i. The sequence specifies the smallest i such that f(i) = n.

0, 1, 2, 11, 3, 22, 4, 23, 14, 24, 5, 34, 6, 25, 16, 26, 7, 36, 8, 27, 18, 28, 9, 38, 19, 29, 119, 39, 229, 49, 239, 68, 249, 59, 268, 69, 259, 88, 269, 79, 288, 89, 279, 189, 289, 99, 389, 199, 299, 1199, 399, 2299, 499, 2399, 689, 2499, 599, 2689, 699, 2599, 889, 2699

Offset

1,3

Links

Table of n, a(n) for n=1..62.

Mathematica

f[n_] := Plus @@ (IntegerDigits[n] /. {0 -> 1, 1 -> 2, 2 -> 3, 3 -> 5, 4 -> 7, 5 -> 11, 6 -> 13, 7 -> 17, 8 -> 19, 9 -> 23}); t = Table[0, {100}]; Do[a = f[n]; If[a < 101 && t[[a]] == 0, t[[f[n]]] = n], {n, 5000}]; t

Crossrefs

Cf. A113581.

Sequence in context: A261300 A068743 A322761 * A241596 A365769 A339616

Adjacent sequences: A113733 A113734 A113735 * A113737 A113738 A113739

Keyword

base,nonn

Author

Amarnath Murthy and Robert G. Wilson v, Nov 08 2005

Status

approved