a(n) = Fibonacci(n) * A004018(n) for n>=1 with a(0)=1, where A004018(n) is the number of ways of writing n as a sum of 2 squares.

A205507

a(n) = Fibonacci(n) * A004018(n) for n>=1 with a(0)=1, where A004018(n) is the number of ways of writing n as a sum of 2 squares.

Terms

    a(0) =1a(1) =4a(2) =4a(3) =0a(4) =12a(5) =40a(6) =0a(7) =0a(8) =84a(9) =136a(10) =440a(11) =0a(12) =0a(13) =1864a(14) =0a(15) =0a(16) =3948a(17) =12776a(18) =10336a(19) =0a(20) =54120a(21) =0a(22) =0a(23) =0a(24) =0a(25) =900300a(26) =971144a(27) =0a(28) =0a(29) =4113832

External references