|
Search: id:A107435
|
|
|
| A107435 |
|
Triangle T(n,k), 1<=k<=n, read by rows : T(n,k) = length of Euclidean algorithm starting with n and k. |
|
+0
1
|
|
| 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 3, 2, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 3, 3, 2, 1, 1, 1, 3, 1, 4, 2, 2, 1, 1, 2, 1, 2, 3, 2, 3, 2, 1, 1, 1, 2, 2, 1, 3, 3, 2, 2, 1, 1, 2, 3, 3, 2, 3, 4, 4, 3, 2, 1, 1, 1, 1, 1, 3, 1, 4, 2, 2, 2, 2, 1, 1, 2, 2, 2, 4, 2, 3, 5, 3, 3, 3, 2, 1, 1, 1, 3, 2, 3, 2, 1, 3
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Theorem of Gabriel LAME (1845) : the first value of m in this triangle is T(F(m+2), F(m+1)) where F(n) = A000045(n); example : the first 5 is T(F(7), F(6)) = T(13, 8).
|
|
FORMULA
|
T(n, k) = A049816(n, k) + 1.
|
|
EXAMPLE
|
13 = 5*2 + 3, 5 = 3*1 + 2, 3 = 2*1 + 1, 2 = 2*1 + 0 = so that T(13,5) = 4.
Triangle begins:
1
1 1
1 2 1
1 1 2 1
1 2 3 2 1
1 1 1 2 2 1
1 2 2 3 3 2 1
1 1 3 1 4 2 2 1
1 2 1 2 3 2 3 2 1
1 1 2 2 1 3 3 2 2 1
1 2 3 3 2 3 4 4 3 2 1
1 1 1 1 3 1 4 2 2 2 2 1
1 2 2 2 4 2 3 5 3 3 3 2 1
1 1 3 2 3 2 1 3 4 3 4 2 2 1
1 2 1 3 1 2 2 3 3 2 4 2 3 2 1
1 1 2 1 2 3 3 1 4 4 3 2 3 2 2 1
1 2 3 2 3 3 3 2 3 4 4 4 3 4 3 2 1
|
|
CROSSREFS
|
Cf. A034883, A049816, A051010.
Sequence in context: A029444 A122191 A097847 this_sequence A118107 A055652 A133831
Adjacent sequences: A107432 A107433 A107434 this_sequence A107436 A107437 A107438
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jun 09 2005
|
|
|
Search completed in 0.002 seconds
|
