login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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)). 1
1, 1, 1, 2, 5, 28, 795, 632167, 399635138154, 159708243647367169100509, 25506723088926795724936617220833650734525459594, 650592922735191299575059973922272937442761432150679274453311138653498403940208837571053997389 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

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 * A000472 A049050 A178322

Adjacent sequences:  A110494 A110495 A110496 * A110498 A110499 A110500

KEYWORD

nonn

AUTHOR

Leroy Quet and Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 22 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 06:27 EST 2012. Contains 205998 sequences.