login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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)). 2
1, 1, 2, 5, 28, 795, 632167, 399635138154, 159708243647367169100509, 25506723088926795724936617220833650734525459594, 650592922735191299575059973922272937442761432150679274453311138653498403940208837571053997389 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
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: A068069 A292499 A306893 * A110497 A000472 A248235
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)