|
%I #9 Mar 28 2014 23:30:39
%S 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,
%T 7,9,10,11,14,6,7,8,10,12,9,13,15,7,8,11,16,17,10,9,7,12,8,13,11,14,
%U 18,15,9,10,8,19,12,14,16,11,13,9,8,10,17,20,15
%N 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.
%p A026400 := proc(nmax) local a,n,lup,k,p ; a := [1,seq(0,i=2..nmax)] ; n := 2 ; while 0 in a do lup := 1 ; while op(lup,a) <> 0 do lup := lup+1 ; od; a := subsop(lup=n,a) ; for k from 2 to n do p := lup+(k-1)*n ; while p <= nmax and op(p,a) <> 0 do p := p+1 ; od: if p <= nmax then a := subsop(p=n,a) ; else break ; fi ; od: n := n+1 ; end: RETURN(a) ; end: A026400(300) ; # _R. J. Mathar_, Nov 30 2008
%K nonn
%O 1,2
%A _Clark Kimberling_
%E Formula in definition corrected by _R. J. Mathar_, Nov 30 2008
|
