|
Search: id:A110497
|
|
|
| A110497 |
|
a(1) = 1; a(m) = maximum denominator 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, 1, 2, 5, 28, 795, 632167, 399635138154, 159708243647367169100509, 25506723088926795724936617220833650734525459594, 65059292273519129957505997392227293744276143215067927445331113865349840394020883\ 7571053997389
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MATHEMATICA
|
a[1] = 1; a[n_] := a[n] = Union[ Denominator /@ FromContinuedFraction /@ Permutations[ Table[ a[i], {i, n - 1}]]] [[ -1]]; Table[ a[n], {n, 11}]
|
|
CROSSREFS
|
Cf. A110498.
Sequence in context: A138293 A068069 A105787 this_sequence A000472 A049050 A165161
Adjacent sequences: A110494 A110495 A110496 this_sequence A110498 A110499 A110500
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet and Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 22 2005
|
|
|
Search completed in 0.005 seconds
|
