Number of reducible ways to split 1, 2, 3, ..., 3n into n arithmetic progressions each with 3 terms: a(n) = A104429(n) - A202705(n).
A279199
Number of reducible ways to split 1, 2, 3, ..., 3n into n arithmetic progressions each with 3 terms: a(n) = A104429(n) - A202705(n).
Terms
- a(0) =0a(1) =0a(2) =1a(3) =3a(4) =9a(5) =30a(6) =117a(7) =512a(8) =2597a(9) =14892a(10) =99034a(11) =721350a(12) =5909324a(13) =52578654a(14) =516148082a(15) =5422071091a(16) =61889692290a(17) =749456672155
External references
- oeis: A279199