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 A173656 #41 Aug 27 2023 09:12:18
%S A173656 521,190699
%N A173656 Primes p such that p^2 divides P(p), where P = Perrin sequence A001608.
%C A173656 It is not known if this sequence is infinite.
%C A173656 The squares are in A013998.
%C A173656 No other terms below 10^10. - _Max Alekseyev_, Aug 27 2023
%H A173656 G. L. Honaker, Jr. and Chris Caldwell, <a href="https://t5k.org/curios/cpage/16432.html">Prime Curios! 521</a>
%H A173656 Wikipedia, <a href="http://en.wikipedia.org/wiki/Perrin_pseudoprime">Perrin number</a>
%e A173656 521 is in the sequence since its square 271441 is the factor of A001608(521).
%t A173656 lst = {}; a = 3; b = 0; c = 2; Do[P = b + a; If[PrimeQ[n] && Divisible[P, n^2], AppendTo[lst, n]]; a = b; b = c; c = P, {n, 3, 2*10^5}]; lst
%t A173656 lst = {}; PowerMod2[mat_, n_, m_] := Mod[Fold[Mod[If[#2 == 1, #1.#1.mat, #1.#1], m] &, mat, Rest@IntegerDigits[n, 2]], m]; LinearRecurrence2[coeffs_, init_, n_, m_] := Mod[First@PowerMod2[Append[RotateRight /@ Most@IdentityMatrix@Length[coeffs], coeffs], n, m].init, m] /; n >= Length[coeffs]; Do[n = Power[p, 2]; If[PrimeQ[p] && LinearRecurrence2[{1, 1, 0}, {3, 0, 2}, n, n] == 0, AppendTo[lst, p]], {p, 1, 2*10^5, 2}]; lst
%o A173656 (PARI)
%o A173656 /* Assuming b13998 containing second column of b013998.txt */
%o A173656 A013998 = readvec(b13998);
%o A173656 for (k=1,#A013998,if (issquare(A013998[k])==1,print(k," ",A013998[k])));
%o A173656 /* _Hugo Pfoertner_, Sep 01 2017 */
%Y A173656 Cf. A001608, A013998.
%K A173656 bref,hard,more,nonn
%O A173656 1,1
%A A173656 _Arkadiusz Wesolowski_, Aug 15 2012