cp's OEIS Frontend

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.

A102325 Primes p such that the largest prime divisor of p^3 + 1 is less than p.

This page as a plain text file.
%I A102325 #8 Jul 08 2018 19:58:39
%S A102325 17,19,23,31,101,103,173,179,257,263,293,353,373,431,467,491,521,563,
%T A102325 593,619,641,677,719,739,773,821,829,857,859,863,881,929,941,953,1031,
%U A102325 1051,1087,1091,1109,1129,1229,1297,1327,1399,1433,1487,1489,1499,1583
%N A102325 Primes p such that the largest prime divisor of p^3 + 1 is less than p.
%H A102325 Giovanni Resta, <a href="/A102325/b102325.txt">Table of n, a(n) for n = 1..10000</a>
%e A102325 p = 17, 1 + p^3 = 1 + 4913 = 2*3*3*3*7*13, so the largest prime factor is 13 < p = 17.
%t A102325 <<NumberTheory`NumberTheoryFunctions` Select[Prime[Range[250]], Max[PrimeFactorList[1 + #^3]] < # &] (* _Ray Chandler_, Jan 08 2005 *)
%Y A102325 Cf. A000040, A065091, A073501, A102326-A102330.
%K A102325 nonn
%O A102325 1,1
%A A102325 _Labos Elemer_, Jan 05 2005