Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #3 Mar 30 2012 17:29:14
%S 3,7,21,3,21,21,9,9,3,23,291,3,149,3,137,489,47,189,63,51,103,271,59,
%T 237,331,369,531,417,249,57,223,297,29,217,473,237,571,451,279,1457,
%U 869,213,317,609,239,57,417,583,879,493,221,989,7,819,1389,423,27,733,309
%N a(n) = (least prime beginning with prime(n) and having as many digits) - (least integer beginning with prime(n) and having as many digits).
%F a(n)=A090927(n) - prime(n)*10^(prime(n)-d), where d = the number of digits in prime(n).
%Y Cf. A090927.
%K base,easy,nonn
%O 1,1
%A _Ray Chandler_, Dec 29 2003