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.

Showing 1-1 of 1 results.

A336688 Primes p such that the Wendt determinant A048954(p) has prime factors less than p.

Original entry on oeis.org

3, 7, 13, 31, 73, 127, 307, 331, 757
Offset: 1

Views

Author

Frank M Jackson and Michael B Rees, Jul 31 2020

Keywords

Comments

Michael B Rees has conjectured that for all primes p, each fully exponentiated prime factor less than p that divides the Wendt determinant W(p), if it exists, is of the form k*p + 1.
This sequence identifies the prime index p of Wendt determinants W(p) that have prime factors less than p.
These prime indices appear to be a subset of the lucky primes A031157.

Examples

			a(3) = 13. The Wendt determinant with a prime index p = 13 has prime factors less than p. W(13) = 3^6*53^2*79^2*131^2*521^2*8191 and 3^6 = 729 is of the form k*13 + 1. It is the 3rd occurrence of such a determinant.
		

Crossrefs

Programs

  • Mathematica
    w[n_] := Resultant[x^n-1, (1+x)^n-1, x]; getp[n_] := Module[{W=w[n], lst=Table[Prime[m], {m, 1, PrimePi[n]}], lst1={}, j, k, l}, Do[j=1; While[W>0&&IntegerQ[W/lst[[l]]^j], j++]; If[j-1>0, AppendTo[lst1, {lst[[l]], j-1}]], {l, 1, Length@lst}]; Join[{n}, lst1]]; lst = {}; Do[lst1=getp[Prime[n]]; If[Length@lst1>1, AppendTo[lst, lst1[[1]]]], {n, 1, PrimePi[331]}]; lst

Extensions

a(9) from Jinyuan Wang, Sep 04 2020
Showing 1-1 of 1 results.