OFFSET
1,3
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000
MAPLE
a:= proc(n) local r, M, p, m; r, M, p, m:=
<<1|0>, <0|1>>, <<0|1>, <1|1>>, n, n*(n+1);
do if irem(p, 2, 'p')=1 then r:= r.M mod m fi;
if p=0 then break fi; M:= M.M mod m
od; r[1, 2]
end:
seq(a(n), n=1..100); # Alois P. Heinz, Nov 26 2016
MATHEMATICA
Table[Mod[Fibonacci[n], n(n+1)], {n, 60}] (* Harvey P. Dale, Oct 02 2017 *)
PROG
(Python)
prpr, prev = 0, 1
for i in range(1, 333):
cur = prpr + prev
print(str(prev % (i*(i+1))), end=', ')
prpr, prev = prev, cur
(PARI) a(n)=fibonacci(n)%(n*(n+1)) \\ Charles R Greathouse IV, Jun 23 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Alex Ratushnyak, Mar 22 2013
STATUS
approved