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
Tue Jun 15 02:37:01 CEST 2010 [seqfan] On the Parity of Stanley's Partition Function -- should a comment go in A097567 or elsewhere?