A219018 Smallest number k > 0 such that k^n + 1 has exactly n distinct prime factors.

1, 3, 5, 43, 17, 47, 51, 1697, 59, 512, 521, 3255, 8189, 18951, 656

Offset

1,2

Comments

a(16) > 2 * 10^6; a(18) = 19208. - Daniel Suteu, Feb 06 2023

Links

Table of n, a(n) for n=1..15.

Example

a(3) = 5 is the smallest number of the set  {k(i)} = {5, 9, 10, 11, 12, 13, 14, 19,….} where k(i)^3 + 1 has exactly 3 distinct prime factors.

Maple

with(numtheory) :for n from 1 to 10 do:ii:=0:for k from 1 to 10^10 while(ii=0) do:x:=k^n+1:y:=factorset(x):n1:=nops(y):if n1=n then ii:=1: printf ( "%d %d \n", n, k):
else fi:od:od:

Mathematica

L = {}; Do[n = 1; While[Length[FactorInteger[n^k + 1]] != k, n++];  Print@AppendTo[L, n], {k, 15}] (* Giovanni Resta, Nov 09 2012 *)

Prog

(PARI) a(n) = my(k=1); while (omega(k^n+1) != n, k++); k; \\ Daniel Suteu, Feb 06 2023

Crossrefs

Cf. A180278, A001221, A281940.

Sequence in context: A258933 A060433 A216085 * A191088 A191089 A199345

Adjacent sequences: A219015 A219016 A219017 * A219019 A219020 A219021

Keyword

nonn,more,hard

Author

Michel Lagneau, Nov 09 2012

Extensions

Definition clarified by Daniel Suteu, Feb 06 2023

a(13)-a(15) from Daniel Suteu, Feb 06 2023

Status

approved