[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
Revision History for A336471 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Lexicographically earliest infinite sequence such that a(i) = a(j) => A329697(i) = A329697(j) and A336158(i) = A336158(j), for all i, j >= 1.
(history; published version)
#28 by Susanna Cuyler at Sat Jul 25 10:36:10 EDT 2020
STATUS

proposed

approved

#27 by Antti Karttunen at Sat Jul 25 06:41:41 EDT 2020
STATUS

editing

proposed

#26 by Antti Karttunen at Sat Jul 25 06:41:23 EDT 2020
COMMENTS

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.

STATUS

proposed

editing

#25 by Antti Karttunen at Sat Jul 25 04:39:26 EDT 2020
STATUS

editing

proposed

#24 by Antti Karttunen at Sat Jul 25 04:34:35 EDT 2020
COMMENTS

a(i) = a(j) => A336469(i) = A336469(j) => A336477(i) = A336477(j).

STATUS

proposed

editing

#23 by Antti Karttunen at Sat Jul 25 00:39:48 EDT 2020
STATUS

editing

proposed

#22 by Antti Karttunen at Sat Jul 25 00:39:17 EDT 2020
COMMENTS

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.

#21 by Antti Karttunen at Sat Jul 25 00:38:37 EDT 2020
COMMENTS

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!

#20 by Antti Karttunen at Sat Jul 25 00:31:44 EDT 2020
COMMENTS

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!

STATUS

proposed

editing

#19 by Antti Karttunen at Sat Jul 25 00:25:35 EDT 2020
STATUS

editing

proposed