[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A350068 (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) => A046523(i) = A046523(j) and A350063(i) = A350063(j), for all i, j >= 1.
(history; published version)
#12 by Michael De Vlieger at Sat Jan 29 22:32:05 EST 2022
STATUS

proposed

approved

#11 by Antti Karttunen at Sat Jan 29 21:40:05 EST 2022
STATUS

editing

proposed

#10 by Antti Karttunen at Sat Jan 29 21:40:00 EST 2022
LINKS

Antti Karttunen, <a href="/A350068/b350068.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)

STATUS

proposed

editing

#9 by Antti Karttunen at Sat Jan 29 21:39:13 EST 2022
STATUS

editing

proposed

#8 by Antti Karttunen at Sat Jan 29 21:38:01 EST 2022
CROSSREFS
#7 by Antti Karttunen at Sat Jan 29 21:27:01 EST 2022
LINKS

Antti Karttunen, <a href="/A350068/b350068.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

#6 by Michael De Vlieger at Sat Jan 29 20:16:27 EST 2022
STATUS

proposed

approved

#5 by Antti Karttunen at Sat Jan 29 19:03:05 EST 2022
STATUS

editing

proposed

#4 by Antti Karttunen at Sat Jan 29 18:14:12 EST 2022
LINKS

<a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>

#3 by Antti Karttunen at Sat Jan 29 15:41:21 EST 2022
CROSSREFS

Cf. A000040 (positions of 2's), A001248 (of 3's).