a(n) = Fibonacci(p) mod p^2, where p = prime(n).

A236395

a(n) = Fibonacci(p) mod p^2, where p = prime(n).

Terms

    a(0) =1a(1) =2a(2) =5a(3) =13a(4) =89a(5) =64a(6) =152a(7) =210a(8) =91a(9) =378a(10) =869a(11) =443a(12) =1641a(13) =85a(14) =1832a(15) =2066a(16) =296a(17) =1465a(18) =2009a(19) =4474a(20) =3211a(21) =5057a(22) =2572a(23) =4184a(24) =2909a(25) =10000a(26) =9475a(27) =10164a(28) =1418a(29) =9378

External references