cp's OEIS Frontend

Note that (k^k-1)/(k-1) is prime only if k is prime, in which case it equals cyclotomic(k,k), the k-th cyclotomic polynomial evaluated at x=k. This sequence is a subsequence of A070519. The number cyclotomic(7547,7547) is a probable prime found by H. Lifchitz. Are there only a finite number of these primes?

From T. D. Noe, Dec 16 2008: (Start)

The standard heuristic implies that there are an infinite number of these primes and that the next k should be between 10^10 and 10^11.

Let N = (7547^7547-1)/(7547-1) = A023037(7547). If N is prime, then the period of the Bell numbers modulo 7547 is N. See A054767. (End)

a(n) is prime for n = {3, 5, 17, 157} = A056826(n) Primes p such that (p^p + 1)/(p + 1) is a prime. Prime a(n) are {7, 521, 45957792327018709121, ...}. Bisection of a(n) is Sierpinski quotient a(2n-1) = A124899(n) = ((2n-1)^(2n-1) + 1)/(2n) = A014566(2n-1)/(2n). - Alexander Adamchuk, Nov 12 2006

This is related to the dimension of the primitive middle cohomology of Dwork hypersurfaces x1**n+x2**n+...+xn**n=n*psi*x1*x2*...*xn. [F. Chapoton, Dec 11 2009]

2n divides Sierpinski number A014566(2n-1).

2^n divides A014566(2^n-1); A014566(2^n - 1) / 2^n = A081216(2^n - 1) = A122000(n) = {1, 7, 102943, 27368368148803711, 533411691585101123706582594658103586126397951, ...}.

p+1 divides A014566(p) for prime p; A014566(p)/(p+1) = A056852(n) = {7, 521, 102943, 23775972551, 21633936185161, ...}.

Primes in this sequence are {7, 521, 45957792327018709121}.

This is a generalization of A056826. Note that (n^n+1)/(n+1) = cyclotomic(2n,n) when n is prime. These are probable primes for n > 352. No others < 4700.

All terms of this sequence that are greater than 3 are congruent to 0 or 1 mod 4. In general, if k = s^2*t where t is squarefree and t == 2, 3 (mod 4), then Cyclotomic(2k,t*x^2) is the product of two polynomials. See the Wikipedia link below. - Jianing Song, Sep 25 2019

This is a generalization of A056826. See A088817 for another generalization. Note that (n^n+1)/(n+1) = cyclotomic(n,-n) when n is prime. Also note that, for odd n>1, cyclotomic(n,-n) = cyclotomic(2n,n) and for n a multiple of 4, cyclotomic(n,-n) = cyclotomic(n,n).

Some of the larger entries may only correspond to probable primes.