|
%I #18 Jun 16 2015 13:27:20
%S 0,0,1,0,2,1,0,3,1,4,2,0,5,2,7,4,1,6,3,0,8,3,11,6,1,9,4,12,7,2,10,5,0,
%T 13,5,18,10,2,15,7,20,12,4,17,9,1,14,6,19,11,3,16,8,0,21,8,29,16,3,24,
%U 11,32,19,6,27,14,1,22,9,30,17,4,25,12,33,20,7
%N List of permutations of the intervals of numbers [0,F(n)) defined by x -> x*F(n-1) mod F(n), where F(n) is the n-th Fibonacci number A000045.
%C This sequence divides into blocks of length F(n), n = 2, 3, 4, 5, 6, ... (so F(n) = 1, 2, 3, 5, 8, ...)
%H Peter G. Anderson, <a href="/A257961/b257961.txt">Table of n, a(n) for n = 0..317808</a>
%e This is an irregular array, the first few rows of which are:
%e 0;
%e 0, 1;
%e 0, 2, 1;
%e 0, 3, 1, 4, 2;
%e 0, 5, 2, 7, 4, 1, 6, 3;
%e 0, 8, 3, 11, 6, 1, 9, 4, 12, 7, 2, 10, 5;
%e 0, 13, 5, 18, 10, 2, 15, 7, 20, 12, 4, 17, 9, 1, 14, 6, 19, 11, 3, 16, 8;
%o (PARI) row(n) = if (n<=2, [0], vector(fibonacci(n), k, (k-1)*fibonacci(n-1) % fibonacci(n))); \\ _Michel Marcus_, May 28 2015
%K nonn,tabf
%O 0,5
%A _Peter G. Anderson_, May 14 2015
|
