The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A100798

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A100798

n occurs n times, as early as possible subject to the constraint that two successive occurrences of n are separated by at least by n terms.
(history; published version)

#12 by Joerg Arndt at Sat Nov 26 10:38:47 EST 2016

STATUS

reviewed

approved

#11 by Jon E. Schoenfield at Sat Nov 26 09:52:05 EST 2016

STATUS

proposed

reviewed

#10 by Jon E. Schoenfield at Sat Nov 26 09:51:49 EST 2016

STATUS

editing

proposed

#9 by Jon E. Schoenfield at Sat Nov 26 09:51:40 EST 2016

CROSSREFS

Cf. A100795, A061925, A074148, A100795.

STATUS

reviewed

editing

#8 by Joerg Arndt at Sat Nov 26 03:17:14 EST 2016

STATUS

proposed

reviewed

#7 by Ivan Neretin at Fri Nov 25 13:39:19 EST 2016

STATUS

editing

proposed

#6 by Ivan Neretin at Fri Nov 25 13:39:11 EST 2016

LINKS

Ivan Neretin, <a href="/A100798/b100798.txt">Table of n, a(n) for n = 1..10000</a>

MATHEMATICA

mx = 22; lst = cnt = ConstantArray[0, mx + 1]; a = {}; Do[k = Min@Select[Range[mx + 1], lst[[#]] <= n && cnt[[#]] < # &]; AppendTo[a, k]; lst[[k]] = n + k + 1; cnt[[k]]++; If[k > mx, Break[]], {n, mx^2}]; a (* Ivan Neretin, Nov 25 2016 *)

STATUS

approved

editing

#5 by N. J. A. Sloane at Thu Dec 05 19:56:59 EST 2013

AUTHOR

_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, Dec 05 2004

Discussion

Thu Dec 05

19:57

OEIS Server: https://oeis.org/edit/global/2075

#4 by Russ Cox at Fri Mar 30 17:29:20 EDT 2012

EXTENSIONS

Extended by _Ray Chandler (rayjchandler(AT)sbcglobal.net), _, Dec 08 2004

Discussion

Fri Mar 30

17:29

OEIS Server: https://oeis.org/edit/global/154

#3 by N. J. A. Sloane at Sat Nov 10 03:00:00 EST 2007

CROSSREFS

Cf. A100795, A100796, A100797A061925, A074148.

KEYWORD

easy,nonn,new