proposed
approved
proposed
approved
editing
proposed
This sequence has an ability to "see" where the terms of A003401 are, as they are the indices of zeros in A336469. More specifically, Specifically, they are numbers k that satisfy the condition A329697(k) = A001221(A336158(k)), i.e., numbers for which A329697(k) is equal to the number of distinct prime divisors of the odd part of k. See also comments in array A334100.
proposed
editing
editing
proposed
editing
proposed
This sequence has an ability to "see" where the terms of A003401 are, as they are the indices of zeros in A336469. More specifically, they are numbers k that satisfy the condition A329697(k) = A001221(A336158(k)) = A001222(A336158(k)), , i.e., numbers for which A329697(k) is equal to the number of distinct prime divisors of the odd part of k. See also array A334100.
This sequence has an ability to "see" where the terms of A003401 are, as they are the indices of zeros in A336469. More specifically, they are numbers k that satisfy the condition A329697(k) = A001221(A336158(k)) = A001222(A336158(k)), i.e., numbers for which A329697(k) is equal to the number of distinct prime divisors of the odd part of k, with the additional condition that the odd part must be squarefree. The latter condition seems actually to be unnecessarySee also array A334100. XXX - Check!
This sequence has an ability to "see" where the terms of A003401 are, as they are the indices of zeros in A336469. More specifically, they are numbers k that satisfy the condition A329697(k) = A001221(A336158(k)) = A001222(A336158(k)), i.e., numbers for which A329697(k) is equal to the number of prime divisors of the odd part of k, with the additional condition that the odd part must be squarefree. The latter condition seems actually to be unnecessary. XXX - Check!
proposed
editing
editing
proposed