A219018 -id:A219018 - cp's OEIS frontend

A368162 a(n) is the smallest number k > 0 such that bigomega(k^n + 1) = n.

1, 3, 3, 43, 7, 32, 23, 643, 17, 207, 251, 3255, 255, 1568, 107

Offset: 1

Daniel Suteu, Dec 14 2023

a(16) <= 206874667; a(17) = 4095; a(18) = 6272; a(21) = 1151.

			a(5) = 7 is the smallest number of the set {k(i)} = {7, 14, 24, 26, 46, 51, ...} where k(i)^5 + 1 has exactly 5 prime factors counted with multiplicity.

Cf. A001222, A219018, A242786, A280005, A281940, A362957.

a(n) = my(k=1); while (bigomega(k^n+1) != n, k++); k;

A379768 a(n) is the smallest prime p such that omega(p^n + 1) = n.

Original entry on oeis.org

2, 3, 5, 43, 17, 47, 151, 1697, 59, 2153, 521, 13183, 30089, 66569, 761

Offset: 1

Daniel Suteu, Jan 06 2025

2*10^6 < a(16) <= 206874667; a(18) = 33577; a(20) <= 3258569.

A219018(n) <= a(n) <= A280005(n).

			a(3) = 5 is the smallest prime of the set {p(i)} = {5, 11, 13, 19, 23, ...} where omega(p(i)^3 + 1) = 3.

Cf. A001221, A219018, A242786, A280005, A362957, A379450.

a[n_] := Module[{p = 2}, While[PrimeNu[p^n + 1] != n, p = NextPrime[p]]; p]; Print[Array[a, 11]]

a(n) = forprime(p=2, oo, if(omega(p^n+1) == n, return(p)));

cp's OEIS Frontend

A368162 a(n) is the smallest number k > 0 such that bigomega(k^n + 1) = n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI