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!)
A236769 Numbers n such that lpf(2^n -1) < lpf(2^lpf(n) -1). 3

%I #18 Jan 04 2024 15:39:51

%S 55,77,161,169,221,275,299,323,377,385,391,437,481,493,539,551,559,

%T 605,611,629,689,697,703,715,731,779,793,799,817,847,893,901,923,935,

%U 949,1001,1007,1027,1045,1073,1079,1121,1127,1147,1159,1241,1265,1271,1273,1309

%N Numbers n such that lpf(2^n -1) < lpf(2^lpf(n) -1).

%C The numbers n for which A049479(n) < A049479(lpf(n)), where lpf(n) = A020639(n). All other n satisfy the equality (in particular all primes).

%C All terms are odd and composite. - _Chai Wah Wu_, Oct 04 2019

%H Chai Wah Wu, <a href="/A236769/b236769.txt">Table of n, a(n) for n = 1..111</a>

%o (PARI) lpf(n) = vecmin(factor(n)[, 1]);

%o lista() = {my(vlpfmp = readvec("A049479.log")); for (i=2, #vlpfmp, if (vlpfmp[i] < vlpfmp[lpf(i)], print1(i, ", ")););} \\ _Michel Marcus_, Jan 31 2014

%Y Cf. A049479 (a question in the third comment).

%K nonn

%O 1,1

%A _Thomas Ordowski_, Jan 31 2014

%E More terms from _Michel Marcus_, Jan 31 2014

%E More terms from _Chai Wah Wu_, Oct 04 2019

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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)