Composite n such that F(n^2+1)==1 (mod n) where F(k) denotes the k-th Fibonacci number.
A086390
Composite n such that F(n^2+1)==1 (mod n) where F(k) denotes the k-th Fibonacci number.
Terms
- a(0) =4a(1) =9a(2) =10a(3) =12a(4) =20a(5) =24a(6) =27a(7) =28a(8) =36a(9) =48a(10) =50a(11) =60a(12) =63a(13) =72a(14) =76a(15) =84a(16) =96a(17) =99a(18) =100a(19) =108a(20) =110a(21) =120a(22) =140a(23) =144a(24) =161a(25) =168a(26) =180a(27) =192a(28) =196a(29) =204
External references
- oeis: A086390