Generated by a 3rd-order formal recursion with suitable initial values as follows: a(n) = n - a(n-1) - a(n-2) - a(n-3); a(0)=a(1)=a(2)=0.

A082507

Generated by a 3rd-order formal recursion with suitable initial values as follows: a(n) = n - a(n-1) - a(n-2) - a(n-3); a(0)=a(1)=a(2)=0.

Terms

    a(0) =2a(1) =0a(2) =0a(3) =0a(4) =3a(5) =1a(6) =1a(7) =1a(8) =4a(9) =2a(10) =2a(11) =2a(12) =5a(13) =3a(14) =3a(15) =3a(16) =6a(17) =4a(18) =4a(19) =4a(20) =7a(21) =5a(22) =5a(23) =5a(24) =8a(25) =6a(26) =6a(27) =6a(28) =9a(29) =7

External references