Number of symmetric maximal irredundant sets in the n-path graph.

Terms

a(0) =1a(1) =0a(2) =2a(3) =2a(4) =2a(5) =2a(6) =3a(7) =3a(8) =5a(9) =6a(10) =7a(11) =6a(12) =10a(13) =12a(14) =15a(15) =15a(16) =22a(17) =23a(18) =33a(19) =35a(20) =48a(21) =48a(22) =71a(23) =75a(24) =103a(25) =106a(26) =152a(27) =158a(28) =225a(29) =234