The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A368163 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A368163

a(n) is the smallest number k > 1 such that bigomega(k^n - 1) = n.
(history; published version)

#9 by Michael De Vlieger at Thu Dec 14 16:30:01 EST 2023

STATUS

reviewed

approved

#8 by Robert Israel at Thu Dec 14 13:23:26 EST 2023

STATUS

proposed

reviewed

#7 by Daniel Suteu at Thu Dec 14 09:19:26 EST 2023

STATUS

editing

proposed

#6 by Daniel Suteu at Thu Dec 14 09:16:41 EST 2023

COMMENTS

a(23) <= 196609; a(24) = 79; a(25) <= 28561; a(26) = 14015; a(27) = 961; a(28) = 729; a(30) = 361; a(32) = 2047.

CROSSREFS

Cf. A001222, A219019, A241793, A359070.

#5 by Daniel Suteu at Thu Dec 14 05:14:50 EST 2023

COMMENTS

a(24) = 79; a(27) = 961; a(28) = 729; a(30) = 361; a(32) = 2047.

FORMULA

a(n) <= A219019(n).

#4 by Daniel Suteu at Thu Dec 14 03:50:15 EST 2023

NAME

allocated for Daniel Suteua(n) is the smallest number k > 1 such that bigomega(k^n - 1) = n.

DATA

3, 4, 4, 10, 17, 8, 25, 5, 28, 9, 81, 13, 289, 64, 100, 41, 6561, 31, 6657, 57, 529, 1025

OFFSET

1,1

FORMULA

a(n) <= A219019(n).

EXAMPLE

a(5) = 17 is the smallest number of the set {k(i)} = {17, 19, 21, 26, 27, 39, 45, ...} where k(i)^5 - 1 has exactly 5 prime factors counted with multiplicity.

PROG

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

CROSSREFS

Cf. A001222, A219019, A359070.

KEYWORD

allocated

nonn,more,hard

AUTHOR

Daniel Suteu, Dec 14 2023

STATUS

approved

editing

#3 by Daniel Suteu at Thu Dec 14 03:50:15 EST 2023

NAME

allocated for Daniel Suteu

KEYWORD

recycled

allocated

#2 by Amiram Eldar at Thu Dec 14 02:30:24 EST 2023

NAME

allocated for Amiram Eldar

KEYWORD

allocated

recycled

#1 by Amiram Eldar at Thu Dec 14 02:29:40 EST 2023

NAME

allocated for Amiram Eldar

KEYWORD

allocated

STATUS

approved