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!)
A096157 Numbers whose numbers of odd and even proper divisors differ at most by 1. 2

%I #18 Dec 16 2021 07:30:51

%S 1,2,3,4,5,6,7,8,10,11,12,13,14,17,18,19,20,22,23,26,28,29,30,31,34,

%T 37,38,41,42,43,44,46,47,50,52,53,54,58,59,61,62,66,67,68,70,71,73,74,

%U 76,78,79,82,83,86,89,90,92,94,97,98,101,102,103,106,107,109,110,113

%N Numbers whose numbers of odd and even proper divisors differ at most by 1.

%C A union of 1, 4, primes, quadrupled primes, and all numbers of the form 4k+2. - _Ivan Neretin_, Aug 12 2015

%H Robert Israel, <a href="/A096157/b096157.txt">Table of n, a(n) for n = 1..10000</a>

%F Abs(A032741(a(n)) - 2*A091954(a(n))) <= 1.

%e Proper divisors of 42 are {1,2,3,6,7,14,21}: 4=#{1,3,7,21} are odd and 3=#{2,6,14} are even, as abs(4-3)=1, 42 is a term.

%p filter:= n -> if n::odd then isprime(n) elif n mod 4 = 0 then isprime(n/4) else true fi:

%p filter(1):= true: filter(4):= true:

%p select(filter, [$1..1000]); # _Robert Israel_, Aug 12 2015

%t okQ[n_] := With[{dd = Most[Divisors[n]]},

%t Abs[2 Count[dd, _?OddQ] - Length[dd]] <= 1];

%t Select[Range[1000], okQ] (* _Jean-François Alcover_, Dec 16 2021 *)

%o (PARI) is(n)=if(bittest(n,0),isprime(n),bittest(n,1)||isprime(n>>2))||n<9 \\ _M. F. Hasler_, Aug 13 2015

%Y Cf. A032741, A091954.

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Jun 18 2004

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 6 21:39 EDT 2024. Contains 375728 sequences. (Running on oeis4.)