|
|
A030717
|
|
The first list after the following procedure: starting with a list [1] and an empty list, repeatedly add the distinct values already in the first list in ascending order to the second list and add the corresponding frequencies of those values to the first list.
|
|
35
|
|
|
1, 1, 2, 2, 1, 3, 2, 3, 3, 1, 4, 3, 3, 4, 3, 5, 1, 5, 3, 6, 2, 1, 6, 4, 7, 2, 2, 1, 7, 6, 7, 3, 2, 2, 1, 8, 8, 8, 3, 2, 3, 3, 8, 9, 11, 3, 2, 3, 3, 3, 8, 10, 15, 3, 2, 3, 3, 4, 1, 1, 10, 11, 18, 4, 2, 3, 3, 5, 1, 1, 1, 1, 14, 12, 20, 5, 3, 3, 3, 5, 1, 2, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
The clarifying comment that follows refers to the old name, which was: 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 row 1, for j=1,2,...,m, where m=max number in row 1 from stages 1 to k-1; state 1 is 1 in row 1.
Numbers j for which the count is 0 are omitted, cf. A333867 for the corresponding sequence where they are included. - Sean A. Irvine, Apr 08 2020
|
|
LINKS
|
|
|
EXAMPLE
|
First list begins:
1;
1;
2;
2, 1;
3, 2;
3, 3, 1;
4, 3, 3;
4, 3, 5, 1;
5, 3, 6, 2, 1;
6, 4, 7, 2, 2, 1;
7, 6, 7, 3, 2, 2, 1;
8, 8, 8, 3, 2, 3, 3;
8, 9, 11, 3, 2, 3, 3, 3;
|
|
MATHEMATICA
|
t = {{1}}; Do[AppendTo[t, BinCounts[#, {1, Max[#] + 1}] &[Flatten[t]]], {25}];
|
|
CROSSREFS
|
Cf. A030707 (repeatedly adds values and frequencies from both lists).
Cf. A333867 (0 counts included, but not the counts of 0s).
|
|
KEYWORD
|
nonn,tabf,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Rolled back to original definition and data by Sean A. Irvine, Apr 08 2020
|
|
STATUS
|
approved
|
|
|
|