|
| |
|
|
A105787
|
|
a(1) = 1; a(m) = maximum 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)).
|
|
1
| |
|
|
1, 1, 2, 5, 28, 795, 632167, 399635138154, 159708243647367169100509, 25506723088926795724936617220833650734525459594, 650592922735191299575059973922272937442761432150679274453311138653498403940208837571053997389
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
EXAMPLE
| a(5)=28 because the maximum numerator among permutations of (1,1,2,5)
happens when the continued fraction is [2;1,1,5]=28/11 or [5;1,1,2]=28/5.
|
|
|
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. A105788.
Sequence in context: A138293 A068069 * A110497 A000472 A049050 A178322
Adjacent sequences: A105784 A105785 A105786 * A105788 A105789 A105790
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Leroy Quet and Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 19 2005
|
| |
|
|
