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 A002649 M3964 N1636 #32 Oct 18 2023 05:00:32 %S A002649 5,31,211,1031,2801,4651,5261,6841,8431,14251,17891,20101,21121,22621, %T A002649 22861,26321,30941,33751,36061,41141,46021,48871,51001,58411,61051, %U A002649 88741,92821,103801,109141,114641,118061,125591,170101,176641,209801 %N A002649 Quintan primes: p = (x^5 - y^5)/(x - y). %C A002649 5 is a term because x^4 + y*x^3 + y^2*x^2 + y^3*x + y^4 = 5 when x=y=1. - _N. J. A. Sloane_, May 12 2014 %D A002649 A. J. C. Cunningham, Binomial Factorisations, Vols. 1-9, Hodgson, London, 1923-1929; see Vol. 2, p. 200. %D A002649 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A002649 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A002649 Jens Kruse Andersen, <a href="/A002649/b002649.txt">Table of n, a(n) for n = 1..10000</a> %H A002649 A. J. C. Cunningham, <a href="/A001912/a001912.pdf">Binomial Factorisations</a>, Vols. 1-9, Hodgson, London, 1923-1929. [Annotated scans of a few pages from Volumes 1 and 2] %o A002649 (PARI) m=10^6; v=[5]; for(x=1, m^(1/4), for(y=1, x-1, n=(x^5-y^5)/(x-y); if(n<=m && isprime(n), v=concat(v,n)))); vecsort(v) \\ _Jens Kruse Andersen_, Jul 14 2014 %Y A002649 Cf. A002650. %K A002649 nonn %O A002649 1,1 %A A002649 _N. J. A. Sloane_ %E A002649 a(26)-a(35) from _Sean A. Irvine_, May 08 2014