Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110498
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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)). +0
2
1, 1, 1, 2, 3, 7, 19, 113, 1579, 136132, 172824797 (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, 12}]

CROSSREFS

Cf. A110497.

Sequence in context: A065060 A164625 A079804 this_sequence A006073 A052402 A011968

Adjacent sequences: A110495 A110496 A110497 this_sequence A110499 A110500 A110501

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research