A255121 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A255121

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

0, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9

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

OFFSET

0,3

COMMENTS

An auxiliary sequence for computing A255122 and A255056.

LINKS

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

PROG

(Scheme, with Antti Karttunen's IntSeq-library)

(define A255121 (COMPOSE -1+ (LEAST-GTE-I 0 1 A255061)))

CROSSREFS

Cf. A255056, A255061, A255071, A255122.