|
%I #14 Dec 30 2013 22:52:19
%S 0,0,131,2221,263,1039,2591,2719,4397,57089,79609,479881,2557967,
%T 1299499,8796629,49979249,349929779,753987769,1397989867,8278487999,
%U 16874789779,69355889899,199785963989,1787899947299,17678888878867
%N Smallest Honaker prime A033548 with digit sum prime(n), or 0 if no such prime exists.
%C From _Robert G. Wilson v_, Jun 08 2009: (Start)
%C If instead the sequence is the least Honaker prime which digit sum a(n) then the terms would begin:
%C 0, 0, 0, 0, 131, 0, 2221, 2141, 0, 6301, 263, 0, 1039, 1049, 0, 457, 2591, 0, 2719, 2729, 0, 3559, 4397, 0, 17359, 17189, 0, 37783, 57089, 0, 79609, 174767, 0, 324799, 349919, 0, 479881, 479783, 0, 879673, 2557967, 0, 1299499, 5487497, 0, 5487697, 8796629, 0, 14657899, 23879489, 0, 47678893, 49979249, 0, 67669687, 139579499, 0, 176937979, 349929779, 0, 753987769, 753987779, 0, 1397989819, 1397778887, 0, 1397989867, ..., . (End)
%C a(26) <= 29678788858889. - _Donovan Johnson_, Dec 29 2013
%F a(n) = min A033548(k): A007953(A033548(k)) = A000040(n). [_R. J. Mathar_, Jun 16 2009]
%e The digit sums of A033548(n) are 5,11,16,13,14,11,5,11,11,14,14,16,8,7,14,11,17,17...
%e The first occurrence of the primes 5,7,11,13,... is at n=1,14,2,.., so the sequence displays A033548(1), A033548(14), A033548(2),...
%t t = Table[0, {100}]; c = 1; p = 2; While[p < 35*10^8, a = Plus @@ IntegerDigits@ c; b = Plus @@ IntegerDigits@ p; If[a < 101 && a == b && t[[a]] == 0, t[[a]] = p; Print[{a, p}]]; c++; p = NextPrime@p]; t[[ # ]] & /@ Prime@ Range@ 19 (* _Robert G. Wilson v_, Jun 08 2009 *)
%Y Cf. A033548.
%K nonn,base
%O 1,3
%A _Lekraj Beedassy_, Jun 06 2009
%E a(12)-a(19) from _Robert G. Wilson v_, Jun 08 2009
%E Simplified definition, added examples - _R. J. Mathar_, Jun 16 2009
%E a(20)-a(24) from _Donovan Johnson_, May 03 2010
%E a(25) from _Donovan Johnson_, Dec 29 2013
|
