A387144 a(n) is the least k>1 such that omega(k^n-1) = omega(k^n+1) with omega = A001221.

3, 2, 2, 3, 3, 2, 3, 3, 2, 3, 2, 3483, 3, 2, 2, 2343, 8, 2, 3, 420, 2, 23, 2, 65, 3, 15, 2, 724, 2, 33, 15

Offset

1,1

Comments

a(32)...a(39): >1000, 2, 5, 8, >1000, 4, 8, 7.

Links

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

Prog

(PARI) a387144(n) = for(k=2, oo, if(omega(k^n-1)==omega(k^n+1), return(k)))

Crossrefs

Cf. A001221, A387145.

Sequence in context: A347381 A075392 A069901 * A115039 A032536 A374167

Adjacent sequences: A387141 A387142 A387143 * A387145 A387146 A387147

Keyword

nonn,more,hard

Author

Hugo Pfoertner, Aug 18 2025

Status

approved