For n >= 1, n n's take places at stage n: the first n takes the least untaken place (l.u.p.) and for 2<=k<=n, the k-th n takes the l.u.p. at least (k-1)*n places past the place of the first n.
1, 2, 3, 2, 4, 3, 5, 6, 3, 4, 7, 5, 4, 6, 8, 9, 4, 5, 7, 6, 10, 5, 8, 11, 7, 6, 5, 9, 12, 13, 8, 6
2 seqfan posts
Sun Nov 30 21:47:13 CET 2008 [seqfan] Re: puzzle: relating sultan's dowry waiting problem A054404 toA026405