This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A089227 #22 May 25 2024 11:12:58
%S A089227 1,2,4,6,10,11,12,13,14,16,17,18,19,20,22,28,33,34,35,38,44,46,48,50,
%T A089227 51,54,56,59,64,68,70,71,78,80,82,84,88,90,91,92,93,94,97,98,99,100,
%U A089227 102,104,105,106,107,109,112,116,118,123,128,129,130,136,138,140,144,145
%N A089227 Numbers k such that 1 + k*ds(k) is prime, where ds(k) is the sum of digits of k.
%H A089227 Robert Israel, <a href="/A089227/b089227.txt">Table of n, a(n) for n = 1..10000</a>
%e A089227 10 is in the sequence because A007953(10) = 1 and 1 + 10*1 = 11 is prime.
%p A089227 ds:= n -> convert(convert(n,base,10),`+`):
%p A089227 filter:= n -> isprime(1+n*ds(n)):
%p A089227 select(filter, [$1..1000]); # _Robert Israel_, Jun 20 2019
%t A089227 Do[k = Plus @@ IntegerDigits[n]; If[PrimeQ[n*k + 1], Print[n]], {n, 1, 100}] (* _Ryan Propper_ *)
%t A089227 Select[Range[150],PrimeQ[#*Total[IntegerDigits[#]]+1]&] (* _Harvey P. Dale_, May 25 2024 *)
%o A089227 (PARI) isok(k) = isprime(1+k*sumdigits(k)); \\ _Michel Marcus_, Jun 20 2019
%o A089227 (Magma) [k:k in [1..145] | IsPrime(1+k*(&+Intseq(k,10)))]; // _Marius A. Burtea_, Jun 21 2019
%Y A089227 Cf. A007953, A057147.
%K A089227 nonn,base
%O A089227 1,2
%A A089227 _Yalcin Aktar_, Dec 10 2003
%E A089227 More terms from _David Wasserman_, Aug 31 2005