Voozh

A261101

After zero, each n occurs A261091(n) times.

0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..7624

PROG

(Scheme) (define (A261101 n) (let loop ((k 0)) (if (>= (A261081 k) n) k (loop (+ 1 k)))))

CROSSREFS

Auxiliary sequence for constructing A261102 and A219648.

Cf. A261081.

Sequence in context: A334863 A329202 A318994 * A327704 A360924 A027434

Adjacent sequences: A261098 A261099 A261100 * A261102 A261103 A261104