a(n)=n*n - [biggest Fibonacci number <= n*n]
0, 1, 1, 3, 4, 2, 15, 9, 26, 11, 32, 0, 25, 52, 81, 23, 56, 91, 128, 23, 64, 107, 152, 199
2 seqfan posts
Fri Apr 30 18:56:07 CEST 2010 [seqfan] Re: Mod[Fibonacci[n],n^2]<=Mod[Fibonacci[n],n]
Fri Apr 30 18:48:53 CEST 2010 [seqfan] Re: Mod[Fibonacci[n],n^2]<=Mod[Fibonacci[n],n]
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.