OFFSET
1,1
COMMENTS
The length of the first row after stage k is 1, 2, 4, 7, 10, 15, 22, 31, 42, 55, 70, 87, 106, ... - Peter Kagey, Apr 09 2020
LINKS
Peter Kagey, Table of n, a(n) for n = 1..9939 (First 80 stages)
EXAMPLE
Stage 1: [
[3],
[]
]
Stage 2: [
[3, 1],
[3]
]
Stage 3: [
[3, 1, 2, 1],
[3, 3, 1]
]
Stage 4: [
[3, 1, 2, 1, 3, 1, 3],
[3, 3, 1, 3, 2, 1]
]
Stage 5: [
[3, 1, 2, 1, 3, 1, 3, 6, 2, 5],
[3, 3, 1, 3, 2, 1, 3, 2, 1]
]
Stage 6: [
[3, 1, 2, 1, 3, 1, 3, 6, 2, 5, 1, 1, 7, 4, 6],
[3, 3, 1, 3, 2, 1, 3, 2, 1, 6, 5, 3, 2, 1]
]
PROG
(Ruby)
def a030777_list(generations)
rows = [[3], []]
(2..generations).each do
new_additions = rows.flatten.uniq.sort.reverse.map do |j|
[rows.flatten.count(j), j]
end
rows = rows.zip(new_additions.transpose).map { |r, n| r + n }
end
rows[0]
end # Peter Kagey, Apr 09 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved