login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A367002 a(n) is the smallest prime factor of n*2^n-1. 3
7, 23, 3, 3, 383, 5, 23, 17, 3, 3, 23, 5, 5, 7, 3, 3, 79, 13, 1879, 13, 3, 3, 47, 7, 229, 5, 3, 3, 32212254719, 263, 223, 5, 3, 3, 5, 73, 17, 1217, 3, 3, 6709, 29, 7, 71, 3, 3, 11, 97, 47, 228713, 3, 3, 5, 37, 5, 7, 3, 3, 9377, 11, 13, 479, 3, 3, 41, 5, 13, 137 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
a(n) = 3 iff n == 4 or 5 (mod 6). - Robert Israel, Nov 08 2023
LINKS
FORMULA
a(n) = A020639(A003261(n)).
MAPLE
f:= n -> min(numtheory:-factorset(n*2^n-1)):
map(f, [$2..100]); # Robert Israel, Nov 08 2023
MATHEMATICA
Table[FactorInteger[n*2^n-1][[1, 1]], {n, 2, 69}] (* Paul F. Marrero Romero, Dec 17 2023 *)
CROSSREFS
Sequence in context: A087184 A067959 A273216 * A070411 A340631 A367003
KEYWORD
nonn
AUTHOR
Sean A. Irvine, Oct 31 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 13 00:40 EDT 2024. Contains 375857 sequences. (Running on oeis4.)