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 A306785 #34 Jan 27 2021 10:34:02 %S A306785 2,5,1051 %N A306785 Primes p such that p^2 divides A050443(p). %C A306785 A050443(p) is divisible by p for p prime, so sequence looks for primes p such that p^2 divides A050443(p). %C A306785 No more terms < 10^11. - _Lucas A. Brown_, Jan 27 2021 %e A306785 A050443(2) = 0 is divisible by 2^2. %e A306785 A050443(5) = 0 is divisible by 5^2. %e A306785 A050443(1051) is divisible by 1051^2. %o A306785 (PARI) M = [0,1,0,0; 0,0,1,0; 0,0,0,1; 1,1,0,0]; %o A306785 b(n) = lift( ( Mod(M,n^2)^n * [4,0,0,3]~)[1] ); \\ A050443(n) mod n^2 %o A306785 forprime(n=2, 10^10, if( b(n)==0, print1(n,", ") ) ); \\ _Joerg Arndt_, Mar 11 2019 %Y A306785 Cf. A000040, A050443, A173656, A306786. %K A306785 nonn,more,bref %O A306785 1,1 %A A306785 _Seiichi Manyama_, Mar 09 2019