login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260867 Least k > 1 that divides A260868(n) + 2^k - 2. 0
35, 161, 55, 35, 115, 35, 115, 35, 77, 209, 473, 253, 55, 77, 35, 235, 247, 55, 35, 35, 899, 119, 1003, 415, 143, 35, 335, 95, 299, 497, 203, 575, 35, 247, 323, 95, 77, 437, 901, 35, 55, 473, 35, 1457, 77, 55, 517, 35, 235, 493, 161, 535, 209, 115, 95, 1067, 689, 323, 35, 1199, 1313, 355, 77, 815, 635, 869, 235, 119, 551, 55, 115 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

For all numbers N not listed in A260868, the least k > 1 that divides N + 2^k - 2 is equal to the least prime factor of N.

It appears that the range of this sequence is A267999. For example, 155 occurs first somewhat late for N = 2729. - Corrected by Thomas Ordowski, Oct 27 2018

LINKS

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

PROG

(PARI) my(aa(n)=for(k=2, 9e9, Mod(2, k)^k+n-2||return(k))); for(n=2, 1e5, aa(n)==factor(n)[1, 1]||print1(aa(n)", "))

CROSSREFS

Sequence in context: A005339 A045614 A154074 * A015219 A195545 A270860

Adjacent sequences:  A260864 A260865 A260866 * A260868 A260869 A260870

KEYWORD

nonn

AUTHOR

M. F. Hasler, Aug 11 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 23:37 EST 2020. Contains 330995 sequences. (Running on oeis4.)