The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A257961 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. 1
 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, 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, 11, 32, 19, 6, 27, 14, 1, 22, 9, 30, 17, 4, 25, 12, 33, 20, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS This sequence divides into blocks of length F(n), n = 2, 3, 4, 5, 6, ... (so F(n) = 1, 2, 3, 5, 8, ...) LINKS Peter G. Anderson, Table of n, a(n) for n = 0..317808 EXAMPLE This is an irregular array, the first few rows of which are: 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, 13, 5, 18, 10, 2, 15, 7, 20, 12, 4, 17, 9, 1, 14, 6, 19, 11, 3, 16, 8; PROG (PARI) row(n) = if (n<=2, [0], vector(fibonacci(n), k, (k-1)*fibonacci(n-1) % fibonacci(n))); \\ Michel Marcus, May 28 2015 CROSSREFS Sequence in context: A102057 A276276 A157497 * A225310 A131358 A291895 Adjacent sequences:  A257958 A257959 A257960 * A257962 A257963 A257964 KEYWORD nonn,tabf AUTHOR Peter G. Anderson, May 14 2015 STATUS approved

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

Last modified May 6 17:52 EDT 2021. Contains 343586 sequences. (Running on oeis4.)