|
|
|
|
1, 2, 2, 3, 3, 3, 6, 4, 4, 4, 4, 6, 6, 6, 6, 6, 9, 9, 9, 9, 9, 9, 9, 9, 9, 12, 8, 8, 8, 8, 8, 8, 8, 8, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 15, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 14, 14, 14, 14, 14, 14, 14
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
For all positive integers n, n appears n times.
|
|
LINKS
|
|
|
EXAMPLE
|
The first terms in this sequence and in A307720 are:
-- ---- ----------
1 1 1
2 2 1
3 2 2
4 3 1
5 3 3
6 3 1
7 6 3
8 4 2
9 4 2
10 4 2
|
|
PROG
|
(PARI) See Links section.
(Python)
from itertools import islice
from collections import Counter
def A307730(): # generator of terms. Greedy algorithm
c, b = Counter(), 1
while True:
k, kb = 1, b
while c[kb] >= kb:
k += 1
kb += b
c[kb] += 1
b = k
yield kb
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|