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 A287959 #10 Jun 09 2017 09:23:18
%S A287959 3,43,8237,14533,26153,11314271
%N A287959 Odd primes p such that p^2 divides A001205(p)-(p-1)/2.
%C A287959 Carlitz proved that A001205(p) == (p-1)/2 (mod p) for all odd primes p. This sequence consists of odd primes for which A001205(p) == (p-1)/2 (mod p^2) holds.
%C A287959 a(7) > 2.3*10^7. - _Giovanni Resta_, Jun 04 2017
%H A287959 Leonard Carlitz, <a href="http://www.jstor.org/stable/2307904">Congruences for the Number of n-Gons Formed by n Lines</a>, The American Mathematical Monthly, Vol. 61, No. 6 (1954), pp. 407-411.
%t A287959 a[1] = 0; a[2] = 0; a[3] = 1; a[n_] := a[n] = (n - 1)*(a[n - 1] + (n - 2)*a[n - 3]/2); lst = {}; k = 3; While[Length[lst] < 5, If[PrimeQ[k] && Divisible[a[k] - (k - 1)/2, k^2], lst = AppendTo[lst, k]]; k++]; lst
%Y A287959 Cf. A001205.
%K A287959 nonn,more
%O A287959 1,1
%A A287959 _Amiram Eldar_, Jun 03 2017
%E A287959 a(6) from _Giovanni Resta_, Jun 04 2017