This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A084500 #16 Jul 19 2021 21:20:01 %S A084500 0,1,2,2,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10,10,11,11,11, %T A084500 11,12,12,12,12,13,13,13,13,14,14,14,14,15,15,15,15,16,16,16,16,17,17, %U A084500 17,17,18,18,18,18,19,19,19,19,20,20,20,20,21,21,21,21,22,22,22,22,23 %N A084500 a(0)=0, after which each n occurs A084506(n) times. %C A084500 Also minimum i such that A084505(i) >= n. Tells that the n-th throw (n>=1) in A084501 belongs to the a(n)-th lexicographical solution A084502(a(n)). %H A084500 A. Karttunen, <a href="/A084500/b084500.txt">Table of n, a(n) for n = 0..13663</a> %H A084500 A. Karttunen, <a href="/A084507/a084507.scm.txt">Scheme-program for computing this sequence</a> %H A084500 <a href="/index/J#Juggling">Index entries for sequences related to juggling</a> %H A084500 <a href="/index/Se#sequences_which_agree_for_a_long_time">Index entries for sequences which agree for a long time but are different</a> %Y A084500 Differs from A084557 first time at the 605th term, where A084500(605) = 130, while A084557(605) = 131. Cf. A084510, A084520. %K A084500 nonn %O A084500 0,3 %A A084500 _Antti Karttunen_, Jun 02 2003