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 A277851 #8 Nov 25 2016 12:34:01 %S A277851 3,6,7,8,11,13,14,18,19,20,21,22,23,25,26,29,30,32,34,35,38,39,40,43, %T A277851 44,45,47,51,53,54,56,58,62,67,68,69,70,71,72,74,75,77,78,80,82,83,87, %U A277851 89,90,91,92,94,97,98,99,102,103,104,105,106,107,108,110,111,112,115,117,118,119,120,122,123,125,126 %N A277851 Numbers not occurring in A075771 (= q(n) + r(n), with n^2 = prime(n)*q(n) + r(n), 0 <= r(n) < prime(n)). %C A277851 The lower bound A075771(n) >= n^2/prime(n) ensures that a given number can't occur beyond a certain index in that sequence. %t A277851 mx = 6300; Take[ Complement[ Range@ mx, Array[Plus @@ IntegerDigits[#^2, Prime[#]] &, mx]], mx/90] (* _Robert G. Wilson v_, Nov 25 2016 *) %o A277851 (PARI) A277851_vec(N,L=N^2\prime(N),A=A075771)=setminus([1..L],Set(vector(N,n,A(n)))) %Y A277851 Cf. A075771, A277852, A277853, A277854. %K A277851 nonn %O A277851 1,1 %A A277851 _M. F. Hasler_, Nov 25 2016