A084557 a(0)=0, after which each n occurs A084556(n) times.

0, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 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, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23

Offset: 0

Author

Antti Karttunen, Jun 02 2003

Keywords

• nonn

Comments

Also minimum i such that A084555(i) >= n.

For n>=1, a(n) tells that the n-th term in A030298 belongs to the a(n):th lexicographically ordered permutation.

Links

• A. Karttunen, Table of n, a(n) for n = 0..40327
• Index entries for sequences related to permutations
• Index entries for sequences which agree for a long time but are different

Crossrefs

Differs from A084500 first time at the 605th term, where A084500(605) = 130, while A084557(605) = 131.