[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 A323135 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) is the least number of iterations that n requires to reach a power of a prime under the map x -> A070229(x), or -1 if we never reach a power of a prime.
(history; published version)
#16 by Joerg Arndt at Mon Apr 06 08:05:40 EDT 2020
STATUS

reviewed

approved

#15 by Michel Marcus at Mon Apr 06 03:34:10 EDT 2020
STATUS

proposed

reviewed

Discussion
Mon Apr 06
03:45
Antti Karttunen: Yes, indeed!
#14 by Antti Karttunen at Mon Apr 06 02:28:06 EDT 2020
STATUS

editing

proposed

Discussion
Mon Apr 06
03:34
Michel Marcus: a magnetic field ?
#13 by Antti Karttunen at Mon Apr 06 02:28:00 EDT 2020
KEYWORD

nonn,look

STATUS

approved

editing

#12 by Joerg Arndt at Sat Jan 12 10:29:28 EST 2019
STATUS

reviewed

approved

#11 by Michel Marcus at Sat Jan 12 05:43:26 EST 2019
STATUS

proposed

reviewed

#10 by Rémy Sigrist at Sat Jan 12 05:33:03 EST 2019
STATUS

editing

proposed

#9 by Rémy Sigrist at Sat Jan 12 05:32:23 EST 2019
LINKS

Rémy Sigrist, <a href="/A323135/b323135.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

Discussion
Sat Jan 12
05:33
Rémy Sigrist: added b-file
#8 by Susanna Cuyler at Fri Jan 11 20:37:59 EST 2019
STATUS

proposed

approved

#7 by Rémy Sigrist at Fri Jan 11 07:59:28 EST 2019
STATUS

editing

proposed