|
Search: id:A105788
|
|
|
| A105788 |
|
a(1) = 1; a(m) = minimum numerator possible with a continued fraction [b(1);b(2),b(3),...b(m-1)], where (b(1),b(2),b(3),...b(m-1)) is a permutation of (a(1),a(2),a(3),...a(m-1)). |
|
+0
2
|
|
| 1, 1, 2, 4, 16, 192, 29984, 776474136, 582837534997525192, 334033256143852482501323872038100184, 111432026121971983026248175426087984579225579894344486903683496908882296
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
a(6)=192 because the minimum numerator among permutations of
(1,1,2,4,16) happens when the continued fraction is [1:4,2,16,1]=192/157 or
[1:16,2,4,1]=192/181.
|
|
MATHEMATICA
|
a[1] = 1; a[n_] := a[n] = Union[ Numerator /@ FromContinuedFraction /@ Permutations[ Table[ a[i], {i, n - 1}]]] [[1]]; Table[ a[n], {n, 11}]
|
|
CROSSREFS
|
Cf. A105787.
Sequence in context: A061588 A050472 A109457 this_sequence A071008 A001146 A114641
Adjacent sequences: A105785 A105786 A105787 this_sequence A105789 A105790 A105791
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 19 2005
|
|
|
Search completed in 0.002 seconds
|
