OFFSET
1,1
LINKS
R. H. Hardin, Table of n, a(n) for n = 1..52
FORMULA
From M. F. Hasler, Aug 21 2025: (Start)
a(n) == 2 (mod 10) for n > 2, (mod 50) for n > 3, (mod 2500) for n > 10, (mod 25000) for n > 21, (mod 125000000000) for n > 26.
a(n) = Sum_{k=0..5} Product_{L=2..n} NC(k*L, L, 5), where NC(s, n, m) is the number of compositions with sum s and n parts between 0 and m. (End)
EXAMPLE
Some solutions for n=4
.....2........3........1........2........2........2........2........2
....1.3......3.3......2.0......1.3......0.4......3.1......1.3......1.3
...2.4.0....3.1.5....2.1.0....1.5.0....4.2.0....0.2.4....3.1.2....1.4.1
..3.3.2.0..4.3.0.5..0.2.1.1..1.2.5.0..3.1.3.1..2.1.2.3..0.2.5.1..1.5.1.1
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jul 22 2012
STATUS
approved
