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!)
 A182167 Min( f(n), n-f(n) ), where f(n) = A002708(n) = Fibonacci(n) mod n. 1
 0, 1, 1, 1, 0, 2, 1, 3, 2, 5, 1, 0, 1, 1, 5, 5, 1, 8, 1, 5, 5, 1, 1, 0, 0, 1, 7, 11, 1, 10, 1, 5, 13, 1, 5, 0, 1, 1, 2, 5, 1, 8, 1, 19, 20, 1, 1, 0, 13, 25, 19, 23, 1, 8, 5, 21, 17, 1, 1, 0, 1, 1, 20, 5, 5, 14, 1, 3, 25, 15, 1, 0, 1, 1, 25, 3, 2, 34, 1, 5, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS Conjecture: the most frequent values are 0,1,2,3,5,8,13,21,34,... i.e Fibonacci numbers. LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 FORMULA a(n) = min( A002708(n) , n - A002708(n) ) a(n) = min( Fibonacci(n) mod n , n - (Fibonacci(n) mod n) ) EXAMPLE a(1) = min( A002708(1) , 1 - A002708(1) ) = min(0,1) = 0,  a(4) = min(3,1) = 1,  a(5) = min(0,5) = 0 PROG (PARI) a(n)=my(f=lift(((Mod([1, 1; 1, 0], n))^n)[1, 2])); min(f, n-f) \\ Charles R Greathouse IV, Apr 16 2012 CROSSREFS Cf. A000045, A002708. Sequence in context: A318729 A024467 A215489 * A117364 A193615 A300383 Adjacent sequences:  A182164 A182165 A182166 * A182168 A182169 A182170 KEYWORD nonn AUTHOR Alex Ratushnyak, Apr 15 2012 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 September 23 02:41 EDT 2021. Contains 347609 sequences. (Running on oeis4.)