This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084520 a(0)=0, after which each n occurs A084526(n) times. 5

%I

%S 0,1,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,

%T 10,11,11,11,11,12,12,12,12,13,13,13,13,14,14,14,14,15,15,15,15,16,16,

%U 16,16,17,17,17,17,18,18,18,18,18,19,19,19,19,19,20,20,20,20,20,21,21,21

%N a(0)=0, after which each n occurs A084526(n) times.

%C Also minimum i such that A084525(i) >= n. Tells that the n-th throw (n>=1) in A084521 belongs to the a(n)-th lexicographical solution A084522(a(n)).

%H A. Karttunen, <a href="/A084507/a084507.scm.txt">Scheme-program for computing this sequence</a>

%Y Differs from A084510 first time at the 65th term, where A084510(65) = 19, while A084520(65) = 18. Cf. A084500.

%K nonn

%O 0,3

%A _Antti Karttunen_, Jun 02 2003

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

Last modified August 18 13:12 EDT 2019. Contains 326100 sequences. (Running on oeis4.)