A220658 Irregular table, where the n-th row consists of A084558(n)+1 copies of n.

0, 1, 1, 2, 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, 20, 20

Offset

0,4

Comments

Equally, for n>=1, each i in range [n!,(n+1)!-1] occurs n+1 times.

Used for computing A220659, A055089 and A060118: The n-th term a(n) tells which permutation (counted from the start, zero-based) of A055089 or A060117/A060118 the n-th term in those sequence belongs to.

Links

A. Karttunen, Rows 0..720 of the irregular table, flattened.

Example

Rows of this irregular table begin as:
0;
1, 1;
2, 2, 2;
3, 3, 3;
4, 4, 4;
5, 5, 5;
6, 6, 6, 6;
The terms A055089(3), A055089(4) and A055089(5) are 1,3,2. As a(3), a(4) and a(5) are all 2, we see that "132" is the second permutation in A055089-list, after the identity permutation "1", which has the index zero.

Prog

(Scheme with Antti Karttunen's intseq-library): (define A220658 (COMPOSE (LEAST-GTE-I 1 0 (COMPOSE A220657 1+)) 1+))

Crossrefs

Cf. A220657, A220659.

Sequence in context: A047743 A062299 A157685 * A127757 A172264 A079001

Adjacent sequences: A220655 A220656 A220657 * A220659 A220660 A220661

Keyword

nonn,tabf

Author

Antti Karttunen, Dec 18 2012

Status

approved