a(1) = 1; a(2) = 0; a(3) = 0; a(4) = 0; a(5) = 0; a(6) = 0; a(7) = 0; a(8) = 0; a(9) = 0; a(10) = 0; a(n) = a(n - 1) + 9a(n - 2) - 8a(n - 3) - 28a(n - 4) + 21a(n - 5) + 35a(n - 6) - 20a(n - 7) - 15a(n - 8) + 5a(n - 9) + a(n - 10) for n >= 11.
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 10, 11, 65, 77, 350, 440, 1700, 2244, 7752, 10659
1 seqfan posts
Sat May 2 16:12:32 CEST 2009 [seqfan] Re: OEIS duplicate hunt