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 A248862 #13 Jul 09 2024 20:48:11
%S A248862 2,47,59,89,173,55439,561599,19824479
%N A248862 Primes p such that 900*p^2 is in the sequence A248861.
%C A248862 From _Jason Yuen_, Jul 01 2024: (Start)
%C A248862 For p>5, an equivalent condition is (240*p*(p-1))^(240*p*(p-1)) == 1 (mod 2821*(1+p+p^2)).
%C A248862 a(9) > 10^12 if it exists. (End)
%t A248862 lastP=2;lst={2};While[lastP<200,If[
%t A248862 Mod[EulerPhi[900*NextPrime[lastP]^2]^EulerPhi[900*NextPrime[lastP]^2],DivisorSigma[1,900*NextPrime[lastP]^2]]==1,
%t A248862 AppendTo[lst,NextPrime[lastP]]];lastP=NextPrime[lastP]];lst (* _Ivan N. Ianakiev_, Dec 15 2014 *)
%Y A248862 Cf. A000040, A248861.
%K A248862 nonn,more,hard
%O A248862 1,1
%A A248862 _Farideh Firoozbakht_, Dec 12 2014