A049837 Triangular array T read by rows: T(n,k)=number of distinct numbers that appear when Euclidean algorithm acts on n,k, for k=1,2,...,n; n=1,2,3,...

2, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 4, 5, 4, 3, 3, 4, 4, 5, 4, 3, 3, 5, 5, 5, 5, 4, 3, 3, 4, 5, 4, 6, 6, 4, 3, 3, 5, 3, 5, 5, 6, 6, 4, 3, 3, 4, 4, 4, 4, 6, 6, 6, 4, 3, 3, 5, 5, 6, 5, 5, 6, 6, 6, 4, 3, 3, 4, 4, 4, 5, 4, 6, 6, 5, 6, 4, 3, 3, 5, 5, 5, 6, 5, 5, 7, 6, 5, 6

Offset

1,1

Comments

Counts numbers appearing as either quotients or remainders including the initial n and k. - Sean A. Irvine, Aug 07 2021

Links

Table of n, a(n) for n=1..89.

Crossrefs

Sequence in context: A088093 A282352 A256858 * A326202 A322988 A098201

Adjacent sequences: A049834 A049835 A049836 * A049838 A049839 A049840

Keyword

nonn,tabl

Author

Clark Kimberling

Status

approved