|
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
|
|
|
%I #9 Sep 06 2019 11:00:50
%S 1,1,1,2,3,7,19,113,1579,136132,172824797
%N 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)).
%t a[1] = 1; a[n_] := a[n] = Union[ Denominator /@ FromContinuedFraction /@ Permutations[ Table[ a[i], {i, n - 1}]]] [[1]]; Table[ a[n], {n, 12}]
%Y Cf. A110497.
%K nonn,more
%O 1,4
%A _Leroy Quet_ and _Robert G. Wilson v_, Jul 22 2005
|
