Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 10).

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =1a(10) =1a(11) =2a(12) =13a(13) =79a(14) =365a(15) =1366a(16) =4369a(17) =12377a(18) =31825a(19) =75583a(20) =167961a(21) =352718a(22) =705466a(23) =1352585a(24) =2501205a(25) =4495351a(26) =7956391a(27) =14221936a(28) =26802361a(29) =56058016