|
Search: id:A116883
|
|
|
| A116883 |
|
A number n is included if (highest odd divisor of n)^2 >= n. |
|
+0
3
|
|
| 1, 3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 81, 82, 83
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Also n is included if (and only if ) the greatest power of 2 dividing n is <= the highest odd divisor of n.
|
|
EXAMPLE
|
20 = 4 * 5, where 4 is highest power of 2 dividing 20, and 5 is the highest odd dividing 20. 4 is <= 5 (and, uncoincidently, 5^2 >= 20), so 20 is in the sequence.
|
|
MAPLE
|
isA116883 := proc(n) local dvs, hod, i ; dvs := convert(numtheory[divisors](n), list) ; for i from 1 to nops(dvs) do hod := op(-i, dvs) ; if hod mod 2 = 1 then RETURN(hod^2 >= n) ; fi ; od ; end: for n from 1 to 200 do if isA116883(n) then printf("%d, ", n) ; fi ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 10 2007
|
|
CROSSREFS
|
Cf. A116882, A000265, A006519.
Adjacent sequences: A116880 A116881 A116882 this_sequence A116884 A116885 A116886
Sequence in context: A062506 A080943 A052294 this_sequence A047984 A125236 A137624
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Feb 24 2006
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 10 2007
|
|
|
Search completed in 0.004 seconds
|
