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 A129630 #22 Apr 29 2024 09:29:09 %S A129630 1,2,4,6,10,11,13,15,19,20,22,24,28,29,31,33,37,40,42,46,48,49,51,55, %T A129630 57,60,64,66,69,73,75,82,84,88,91,93,97,100,101,103,105,109,110,112, %U A129630 114,118,119,121,123,127,130,132,136,138,139,141,145,147,150,154,156,159 %N A129630 Numbers k such that sum of digits of (k+1) is a prime. %F A129630 a(n) = A028834(n) - 1. %p A129630 P:=proc(n) local i,k,w; for i from 1 by 1 to n do w:=0; k:=binomial(i+1,i); while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; if isprime(w) then print(i); fi; od; end: P(1000); %t A129630 Select[Range[200], PrimeQ[Total[IntegerDigits[# + 1]]] &] %Y A129630 Cf. A007953, A028834. %K A129630 nonn,base,easy %O A129630 1,2 %A A129630 _Paolo P. Lava_ and _Giorgio Balzarotti_, May 31 2007