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 A084505 #17 Jul 29 2017 12:58:32 %S A084505 0,1,3,5,8,11,14,17,20,23,27,31,35,39,43,47,51,55,59,63,67,71,75,79, %T A084505 83,87,91,95,99,103,107,111,115,119,124,129,134,139,144,149,154,159, %U A084505 164,169,174,179,184,189,194,199,204,209,214,219,224,229,234,239,244,249 %N A084505 Partial sums of A084506. %C A084505 For n>=1, (a(n-1)+1,a(n)) = (1,1),(2,3),(4,5),(6,8),(9,11),(12,14),... gives the starting and ending offsets of the n-th site swap in the sequence A084501. %C A084505 Note: this sequence is related to juggling with three objects. For a similar sequence related to (ordinary) permutations, see A084555. %H A084505 A. Karttunen, <a href="/A084505/b084505.txt">Table of n, a(n) for n = 0..32770</a> %H A084505 A. Karttunen, <a href="/A084507/a084507.scm.txt">Scheme-program for computing this sequence</a> %H A084505 <a href="/index/J#Juggling">Index entries for sequences related to juggling</a> %Y A084505 Differs from A084555 first time at the 130th term, where A084505(130) = 605, while A084555(130) = 604. %Y A084505 A084503(a(n)) = 7 for all n. However, this does not give the positions of all 7s in A084503 because the state sequences are not all indecomposable. Cf. A084515, A084525. %K A084505 nonn %O A084505 0,3 %A A084505 _Antti Karttunen_, Jun 02 2003 %E A084505 Added the b-file, moved the misplaced Mathematica code to A084555, where it belongs. - _Antti Karttunen_, Oct 24 2012