login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120350 Refactorable numbers such that the number of odd divisors r and the number of even divisors s are both divisors of n. 0
2, 12, 18, 24, 36, 72, 80, 180, 240, 252, 360, 396, 450, 468, 480, 504, 560, 612, 684, 720, 792, 828, 880, 882, 896, 936, 972, 1040, 1044, 1116, 1200, 1224, 1250, 1332, 1344, 1360, 1368, 1440, 1476, 1520, 1548, 1620, 1656, 1692, 1840, 1908, 1944, 2000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Since s=0 if n is odd, the number n is necessarily even and then s is always a multiple of r. Note that t=r+s may not be a divisor even if both r and s are divisors. For example, if n=144, then r=3, s=12, but t=r+s=15.

LINKS

Table of n, a(n) for n=0..47.

FORMULA

a(n) = n is even, r = number of odd divisors of n, s = number of even divisors of n and t = r + s = number of divisors of n, are all divisors of n.

EXAMPLE

a(3)=18 since r=3, s=3 and t=r+s=6 are all divisors.

MAPLE

with(numtheory); A:=[]: for w to 1 do for k from 1 to 5000 do n:=2*k; S:=divisors(n); r:=nops( select(z->type(z, odd), S) ); s:=nops( select(z->type(z, even), S) ); t:=r+s; if andmap(z -> n mod z = 0, [r, s, t]) then A:=[op(A), n]; print(n, r, s, t); fi; od od; A;

CROSSREFS

Cf. A033950, A049439, A057265.

Sequence in context: A277961 A294998 A323762 * A293851 A032413 A262897

Adjacent sequences:  A120347 A120348 A120349 * A120351 A120352 A120353

KEYWORD

nonn

AUTHOR

Walter Kehowski, Jun 24 2006

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 August 21 22:32 EDT 2019. Contains 326169 sequences. (Running on oeis4.)