cp's OEIS Frontend

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.

A140060 Array of quotients.

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Clark Kimberling, May 03 2008

Keywords

Comments

1. k divides Q(n,k) for each k.
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.

Examples

			First 8 rows:
1
2 2
3 2
4 4 3
5 4 3
6 6 6 4
7 6 6 4
8 8 6 4
For row 5: Q(5,1)=5, Q(5,2)=2*[5/2]=4, Q(5,3)=3*[4/3]=3.
		

Crossrefs

Cf. A140061.

Formula

For n>=1, for k=1,2,...,A082447(n), Q(n,1)=n, Q(n,k)=k*Floor(Q(n,k-1)/k).