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 A140060 #3 Mar 30 2012 18:57:10 %S A140060 1,2,2,3,2,4,4,3,5,4,3,6,6,6,4,7,6,6,4,8,8,6,4,9,8,6,4,10,10,9,8,5,11, %T A140060 10,9,8,5,12,12,12,12,10,6,13,12,12,12,10,6,14,14,12,12,10,6,15,14,12, %U A140060 12,10,6,16,16,15,12,10,6,17,16,15,12,10,6,18,18,18,16,15,12,7,19,18,18 %N A140060 Array of quotients. %C A140060 1. k divides Q(n,k) for each k. %C A140060 2. The numbers in row n are distinct if and only if n is a term of the Sieve of Tchoukaillon (or Mancala, or Kalahari), A007952. %F A140060 For n>=1, for k=1,2,...,A082447(n), Q(n,1)=n, Q(n,k)=k*Floor(Q(n,k-1)/k). %e A140060 First 8 rows: %e A140060 1 %e A140060 2 2 %e A140060 3 2 %e A140060 4 4 3 %e A140060 5 4 3 %e A140060 6 6 6 4 %e A140060 7 6 6 4 %e A140060 8 8 6 4 %e A140060 For row 5: Q(5,1)=5, Q(5,2)=2*[5/2]=4, Q(5,3)=3*[4/3]=3. %Y A140060 Cf. A140061. %K A140060 nonn,tabf %O A140060 1,2 %A A140060 _Clark Kimberling_, May 03 2008