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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110498 a(1) = 1; a(m) = minimum 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, 3, 7, 19, 113, 1579, 136132, 172824797 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..11.

MATHEMATICA

a[1] = 1; a[n_] := a[n] = Union[ Denominator /@ FromContinuedFraction /@ Permutations[ Table[ a[i], {i, n - 1}]]] [[1]]; Table[ a[n], {n, 12}]

CROSSREFS

Cf. A110497.

Sequence in context: A294148 A079804 A075487 * A244917 A172976 A171655

Adjacent sequences:  A110495 A110496 A110497 * A110499 A110500 A110501

KEYWORD

nonn

AUTHOR

Leroy Quet and Robert G. Wilson v, Jul 22 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified February 24 17:22 EST 2018. Contains 299624 sequences. (Running on oeis4.)