OFFSET
1,3
COMMENTS
a(n)=0 for n=1 and n=12 only (conjecture).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..20000 (first 1000 terms from Hieronymus Fischer)
EXAMPLE
a(13) = 64, since Fibonacci(13) = 233 == 64 (mod 13^2).
MAPLE
p:= (M, n, k)-> map(x-> x mod k, `if`(n=0, <<1|0>, <0|1>>,
`if`(n::even, p(M, n/2, k)^2, p(M, n-1, k).M))):
a:= n-> p(<<0|1>, <1|1>>, n, n^2)[1, 2]:
seq(a(n), n=1..80);
MATHEMATICA
Table[Mod[Fibonacci[n], n^2], {n, 200}] (* Vladimir Joseph Stephan Orlovsky, Nov 28 2010 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Hieronymus Fischer, Aug 24 2007
STATUS
approved