A084510 a(0)=0, after which each n occurs A084516(n) times.

0, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21, 21

Offset

0,3

Comments

Also minimum i such that A084515(i) >= n. Tells that the n-th throw (n>=1) in A084511 belongs to the a(n)-th lexicographical solution A084512(a(n)).

Links

Table of n, a(n) for n=0..78.

A. Karttunen, Scheme-program for computing this sequence

Crossrefs

Differs from A084520 first time at the 65th term, where A084510(65) = 19, while A084520(65) = 18.

Cf. A084500.

Sequence in context: A196390 A054846 A084520 * A053620 A283302 A225593

Adjacent sequences: A084507 A084508 A084509 * A084511 A084512 A084513

Keyword

nonn

Author

Antti Karttunen, Jun 02 2003

Status

approved