|
| |
|
|
A030717
|
|
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.
|
|
15
|
|
|
|
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
|
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
|
Sean A. Irvine, Table of n, a(n) for n = 1..1000
Sean A. Irvine, Java program (github)
|
|
|
EXAMPLE
|
1;
1;
2;
2, 1;
3, 2;
3, 3, 1;
4, 3, 3;
|
|
|
MATHEMATICA
|
t = {{1}}; Do[AppendTo[t, BinCounts[#, {1, Max[#] + 1}] &[Flatten[t]]], {25}];
DeleteCases[Flatten[t], 0] (* Peter J. C. Moses, Apr 09 2020 *)
|
|
|
CROSSREFS
|
Cf. A030719 (row lengths), A006920, A030718 (column numbers).
Cf. A333867 (zeros included).
Sequence in context: A322529 A329949 A333867 * A280716 A319444 A071285
Adjacent sequences: A030714 A030715 A030716 * A030718 A030719 A030720
|
|
|
KEYWORD
|
nonn,tabf,nice
|
|
|
AUTHOR
|
Clark Kimberling
|
|
|
EXTENSIONS
|
More terms from Franklin T. Adams-Watters, Dec 14 2006
Rolled back to original definition and data by Sean A. Irvine, Apr 08 2020
|
|
|
STATUS
|
approved
|
| |
|
|
