a(n) is the number of binary words containing n 1's and at most n 0's that do not contain the substring 101.
A225034
a(n) is the number of binary words containing n 1's and at most n 0's that do not contain the substring 101.
Terms
- a(0) =1a(1) =3a(2) =7a(3) =18a(4) =48a(5) =131a(6) =363a(7) =1017a(8) =2873a(9) =8169a(10) =23349a(11) =67024a(12) =193086a(13) =557949a(14) =1616501a(15) =4694034a(16) =13657896a(17) =39809649a(18) =116218701a(19) =339762942a(20) =994553160a(21) =2914608177a(22) =8550424953a(23) =25107964077a(24) =73793368593a(25) =217057617567a(26) =638936722403
External references
- oeis: A225034