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 A054964 #10 Nov 21 2019 10:44:12 %S A054964 1,2,5,10,17,37,101,197,257,401,577,677,1297,1601,2917,3137,4357,5477, %T A054964 7057,8101,8837,12101,13457,14401,15377,15877,16901,17957,21317,22501, %U A054964 24337,25601,28901,30977,32401,33857,41617,42437,44101,50177 %N A054964 Numbers whose divisors have the form m^k + 1, k>1. %H A054964 Jean-François Alcover, <a href="/A054964/b054964.txt">Table of n, a(n) for n = 1..10002</a> %e A054964 1 =0*0+1, 2 = 1*1+1, 5 = 2*2+1, 10 = 3*3+1 = 2*5, 17 = 4*4+1, ... %t A054964 okQ[n_] := n==1 || n==10 || PrimeQ[n] && IntegerQ[Sqrt[n-1]]; (* _Jean-François Alcover_, Nov 21 2019, after _Charles R Greathouse IV_ *) %o A054964 (PARI) is(n)=(isprime(n) && issquare(n-1)) || n==1 || n==10 \\ _Charles R Greathouse IV_, Mar 11 2014 %Y A054964 A002496 together with 1 and 10: a(n+5)=A002496(n+3). %K A054964 nonn,easy,nice %O A054964 1,2 %A A054964 Antreas P. Hatzipolakis (xpolakis(AT)otenet.gr), May 24 2000