Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #18 Jan 21 2019 19:01:55
%S 2,3,5,7,11,13,17,19,23,29,32,33,35,37,41,43,47,49,53,59,52,53,55,57,
%T 61,63,67,69,73,79,72,73,75,77,81,83,87,89,93,99,112,113,115,117,121,
%U 123,127,129,133,139,132,133,135,137,141,143,147,149,153,159,172,173,175
%N Write n in decimal and replace each digit d with prime(d+1), add overflow to the next position left.
%H Alois P. Heinz, <a href="/A100110/b100110.txt">Table of n, a(n) for n = 0..10000</a>
%e a(5) = prime(6) = 13.
%e a(55) = 1(3+1)3 = 143.
%p a:= n-> (l-> add(ithprime(l[i]+1)*10^(i-1),
%p i=1..nops(l)))(convert(n, base, 10)):
%p seq(a(n), n=0..80); # _Alois P. Heinz_, Aug 27 2015
%t Table[FromDigits[Prime[(IntegerDigits[n] + 1)]], {n, 0, 70}] (* _Stefan Steinerberger_, Mar 27 2006 *)
%K nonn,base,easy
%O 0,1
%A _Jorge Coveiro_, Dec 26 2004
%E More terms from _Stefan Steinerberger_, Mar 27 2006