Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.
A000028
Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.
Terms
- a(0) =2a(1) =3a(2) =4a(3) =5a(4) =7a(5) =9a(6) =11a(7) =13a(8) =16a(9) =17a(10) =19a(11) =23a(12) =24a(13) =25a(14) =29a(15) =30a(16) =31a(17) =37a(18) =40a(19) =41a(20) =42a(21) =43a(22) =47a(23) =49a(24) =53a(25) =54a(26) =56a(27) =59a(28) =60a(29) =61
External references
- oeis: A000028