|
%I #15 Dec 27 2019 07:49:56
%S 1,1,2,1,3,5,1,2,4,5,1,2,3,4,6,1,3,5,7,9,11,1,2,3,4,5,6,7,1,2,4,5,8,
%T 10,11,13,1,3,5,7,9,11,13,15,19,1,2,3,4,6,7,8,9,12,13,1,2,3,4,5,6,7,8,
%U 9,10,11,1,5,7,11,13,17,19,23,25,29,31,35,1,2,3,4,5,6,7,8,9,10,11,12,13,1,2,3,4,5,6,7,8,9,10,11,12,14,15,1,3,7,9,11,13,17,19,21,23,27,29,31,33,37,1,2,4,5,8,10,11,13,16,17,19,20,22,23,25,26
%N Triangle where the n-th row lists the smallest n positive integers which are coprime to the n-th Fibonacci number.
%H Michael De Vlieger, <a href="/A129322/b129322.txt">Table of n, a(n) for n = 1..11325</a> (rows 1 <= n <= 150, flattened).
%e The 8th Fibonacci number is 21. So row 8 lists the 8 smallest positive integers which are coprime to 21: (1,2,4,5,8,10,11,13).
%e 1;
%e 1,2;
%e 1,3,5;
%e 1,2,4,5;
%e 1,2,3,4,6;
%e 1,3,5,7,9,11;
%e 1,2,3,4,5,6,7;
%e 1,2,4,5,8,10,11,13;
%e 1,3,5,7,9,11,13,15,19;
%e 1,2,3,4,6,7,8,9,12,13;
%p A129322 := proc(n,m)
%p option remember;
%p local f,a;
%p f := combinat[fibonacci](n) ;
%p if m = 1 then
%p return 1;
%p else
%p for a from procname(n,m-1)+1 do
%p if igcd(f,a) = 1 then
%p return a;
%p end if;
%p end do:
%p end if;
%p end proc: # _R. J. Mathar_, Dec 14 2016
%t Table[Block[{m = Fibonacci@n, r = {1}, k = 2}, While[Length@ r < n, If[GCD[k, m] == 1, AppendTo[r, k], Nothing]; k++]; r], {n, 16}] // Flatten (* _Michael De Vlieger_, Dec 26 2019 *)
%Y Cf. A120839 (diagonal).
%K nonn,tabl
%O 1,3
%A _Leroy Quet_, May 26 2007
%E More terms from _R. J. Mathar_, Nov 01 2007
|
