The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A030747

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

The first list after the following procedure: starting with a list [4] and an empty list, repeatedly add the distinct values already in both lists in ascending order to the second list and add the corresponding frequencies of those values to the first list.
(history; published version)

#8 by Michael De Vlieger at Sun Oct 09 15:45:00 EDT 2022

STATUS

proposed

approved

#7 by Peter Munn at Sun Oct 09 14:37:06 EDT 2022

STATUS

editing

proposed

#6 by Peter Munn at Sun Oct 09 13:20:34 EDT 2022

CROSSREFS

The 2nd list is A030748.

Discussion

Sun Oct 09

14:37

Peter Munn: Change to the name as agreed for other sequences in the same family, essentially as agreed for A030777/8 by Peter Kagey and NJAS in 2020.

#5 by Peter Munn at Sun Oct 09 12:28:43 EDT 2022

NAME

Row 1, where, at stage k>1, write i in row 1 The first list after the following procedure: starting with a list [4] and j in row 2, where i is an empty list, repeatedly add the number of j's distinct values already in both lists in rows 1 ascending order to the second list and 2, for j=1,2,...,m, where m=max number in row 1 from stages 1 add the corresponding frequencies of those values to k-1; stage 1 is 4 in row 1the first list.

CROSSREFS

The 2nd list is A030748

EXTENSIONS

Name revised in line with A030777 by Peter Munn, Oct 09 2022

STATUS

approved

editing

#4 by Russ Cox at Fri Mar 30 18:56:19 EDT 2012

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Clark Kimberling

Discussion

Fri Mar 30

18:56

OEIS Server: https://oeis.org/edit/global/285

#3 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003

KEYWORD

nonn,new

nonn

AUTHOR

Clark Kimberling, (ck6(AT)evansville.edu)

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

KEYWORD

nonn,new

nonn

AUTHOR

Clark Kimberling, ck6@cedar.(AT)evansville.edu

#1 by N. J. A. Sloane at Sat Dec 11 03:00:00 EST 1999

NAME

Row 1, where, at stage k>1, write i in row 1 and j in row 2, where i is the number of j's in rows 1 and 2, for j=1,2,...,m, where m=max number in row 1 from stages 1 to k-1; stage 1 is 4 in row 1.

DATA

4, 1, 1, 2, 3, 1, 3, 5, 2, 2, 4, 6, 5, 3, 6, 1, 8, 6, 5, 7, 3, 2, 9, 8, 7, 8, 5, 4, 1, 1, 12, 9, 8, 10, 7, 5, 3, 4, 1, 14, 10, 10, 12, 9, 6, 5, 6, 3, 1, 1, 17, 11, 12, 13, 11, 9, 6, 7, 5, 4, 3, 1, 19, 12, 14, 15, 13, 11, 8, 8, 7, 5, 2, 5, 1, 2, 1, 22, 15, 15, 16

OFFSET

1,1

KEYWORD

nonn

AUTHOR

Clark Kimberling, [email protected]

STATUS

approved