The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A290100

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A290100

Start from the singleton set S = {n}, and unless 1 is already a member of S, generate on each iteration a new set where each odd number k is replaced by 3k+1, and each even number k is replaced by 3k+1 and k/2. a(n) is the size of the set after the first iteration which has produced 1 as a member.
(history; published version)

#49 by Alois P. Heinz at Mon Nov 06 02:36:28 EST 2023

STATUS

reviewed

approved

#48 by Michel Marcus at Mon Nov 06 02:16:20 EST 2023

STATUS

proposed

reviewed

#47 by Jon E. Schoenfield at Mon Nov 06 02:14:28 EST 2023

STATUS

editing

proposed

#46 by Jon E. Schoenfield at Mon Nov 06 02:14:06 EST 2023

LINKS

Antti Karttunen and Michael De Vlieger, <a href="/A290100/b290100.txt">Table of n, a(n) for n = 1..450</a> (first 126 terms from Antti Karttunen)

STATUS

approved

editing

#45 by Joerg Arndt at Mon Mar 23 06:21:34 EDT 2020

STATUS

reviewed

approved

#44 by Michel Marcus at Mon Mar 23 03:57:31 EDT 2020

STATUS

proposed

reviewed

#43 by F. Chapoton at Mon Mar 23 03:40:57 EDT 2020

STATUS

editing

proposed

#42 by F. Chapoton at Mon Mar 23 03:40:48 EDT 2020

PROG

for i in range(1, 101): print (a(i)) # Indranil Ghosh, Aug 31 2017

STATUS

approved

editing

Discussion

Mon Mar 23

03:40

F. Chapoton: no space after print in python code

#41 by Susanna Cuyler at Thu Aug 31 23:03:53 EDT 2017

STATUS

proposed

approved

#40 by Indranil Ghosh at Thu Aug 31 16:20:22 EDT 2017

STATUS

editing

proposed