|
| |
|
|
A071595
|
|
Odd n such that the number of 1's in binary representation of n equals omega(n), the number of distinct primes in n factorization.
|
|
2
| |
|
|
33, 65, 129, 273, 385, 513, 1025, 1155, 1281, 2049, 2065, 2145, 4097, 4161, 4641, 8193, 8195, 8211, 8225, 8265, 8385, 8449, 9345, 10241, 16905, 17409, 21505, 24585, 32775, 32785, 32835, 32865, 33033, 33285, 33345, 33825, 34881, 36865, 36993
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| 129=10000001 in base 2 and 129=3*43 hence 129 is in the sequence.
|
|
|
PROG
| (PARI) for(n=1, 80000, if(sum(i=1, length(binary(n)), component(binary(n), i))==-(-1)^n*omega(n), print1(n, ", ")))
|
|
|
CROSSREFS
| Cf. A071594, A071596.
Sequence in context: A061560 A118618 A163411 * A032661 A055078 A044135
Adjacent sequences: A071592 A071593 A071594 * A071596 A071597 A071598
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 01 2002
|
| |
|
|
