**a(0) = 0, a(1) = 1, a(n) = Mod[a(n-1),F(n)]*a(n-1) + a(n-2) for n > 2 where F(n) is the n-th Fibonacci number.**

*0, 1, 0, 1, 1, 2, 5, 27, 167, 5204, 177103, 14527650, 959002003, 94955725947*

*1 seqfan posts*

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 .