login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026400 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. 9
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, 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, 18, 15, 9, 10, 8, 19, 12, 14, 16, 11, 13, 9, 8, 10, 17, 20, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MAPLE
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
CROSSREFS
Sequence in context: A199474 A246694 A054384 * A026409 A336215 A243290
KEYWORD
nonn
AUTHOR
EXTENSIONS
Formula in definition corrected by R. J. Mathar, Nov 30 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 10:22 EDT 2024. Contains 371268 sequences. (Running on oeis4.)