|
%I #8 Aug 09 2015 02:57:37
%S 2,11,3,13,31,103,211,1021,1201,2011,3001,5,23,41,113,131,311,401,
%T 1013,1031,1103,1301,2003,2111,3011,4001,10103,10211,10301,11003,
%U 12011,12101,13001,20021,20201,21011,21101,30011,7,43,61,151,223,241,313,331,421
%N Primes with at most n digits and a digit sum n in ascending order. 2,11; 3; 13,31,103,211,1021,2011,3001; 5,23,41,113,...
%p A007953 := proc(n) add(i,i=convert(n,base,10)) ; end: A110741 := proc(nmin) local a,n,p ; a := [] ; n := 2; while nops(a) < nmin do p := 2 ; while p < 10^n do if A007953(p) = n then a := [op(a),p] ; fi ; p := nextprime(p) ; od ; n := n+1 ; od; RETURN(a) ; end: A110741(40) ; # _R. J. Mathar_, Aug 17 2007
%Y Cf. A110742.
%K base,easy,nonn
%O 2,1
%A _Amarnath Murthy_, Aug 10 2005
%E More terms from _R. J. Mathar_, Aug 17 2007
|
