|
%I #21 Mar 26 2021 09:25:08
%S 108,2688,3528,4968,6480,15288,18048,20808,21000,25308,35448,47520,
%T 62928,68208,81648,82008,97608,103968,108288,116928,137088,139968,
%U 151848,162288,196560,197568,200928,235008,238728,253368,278208,363888,379008,400248,444528,449568,457608
%N Number n such that Fibonacci(n) is divisible by n, n + 1 and n - 1.
%C Numbers n such that Fibonacci(n) mod n = Fibonacci(n) mod (n-1) = Fibonacci(n) mod (n+1) = 0.
%C Subsequence of A023172.
%H Chai Wah Wu, <a href="/A221018/b221018.txt">Table of n, a(n) for n = 1..200</a>
%o (Python)
%o prpr, prev = 0, 1
%o for n in range(2, 100000):
%o prpr, prev = prev, prpr+prev
%o if n%2: continue
%o if (prev % n, prev % (n-1), prev % (n+1)) == (0, 0, 0):
%o print(n, end=", ")
%Y Cf. A000045, A023172, A225219.
%K nonn
%O 1,1
%A _Alex Ratushnyak_, May 03 2013
|
