login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A336739
a(n) is the number of decompositions of H(n,1) into disjoint unions of H(j,k) where H(j,k) is the set of numbers { (2*i-1)*(2*k-1), 1 <= i <= j }.
1
1, 2, 3, 4, 6, 7, 8, 13, 14, 15, 25, 26, 33, 50, 51, 52, 95, 152, 153, 295, 296, 297, 542, 543, 672, 1329, 1330, 2055, 4093, 4094, 4095, 6992, 10697, 10698, 21375, 21376, 21377, 39051, 55948, 55949, 86454, 86455, 130396, 260765, 260766, 365839, 731649, 1100442
OFFSET
1,2
EXAMPLE
H(n,1) are the sets {1}, {1,3}, {1,3,5}, {1,3,5,7}, ...
H(n,2) are the sets {3}, {3,9}, {3,9,15}, {3,9,15,21}, ...
H(n,3) are the sets {5}, {5,15}, {5,15,25}, {5,15,25,35}, ...
a(2) = 2 because there are two decompositions of H(2,1) = {1,3}: the trivial H(2,1) and H(1,1) + H(1,2) = {1} + {3}.
The a(5) = 6 decompositions of {1,3,5,7,9} are:
{{1,3,5,7,9}},
{{1,3,5,7}, {9}},
{{1,3,5}, {7}, {9}},
{{1,3}, {5}, {7}, {9}},
{{1}, {3}, {5}, {7}, {9}},
{{3,9}, {1}, {5}, {7}}.
PROG
(PARI)
tiles(S, t)={((i, b)->1 + sum(i=1, i, if(!bitnegimply(S[i], b), self()(i-1, b-S[i]))))(#S, t)}
H(j, k)={sum(i=1, j, 1<<((2*k-1)*(2*i-1)))}
a(n)={my(S=concat(vector(n, k, vector(n\(2*k-1), j, H(1+j, k))))); tiles(S, H(n, 1))} \\ Andrew Howroyd, Oct 02 2020
CROSSREFS
Cf. A335631.
Sequence in context: A283112 A174099 A099005 * A257648 A096360 A039087
KEYWORD
nonn
AUTHOR
Miloslav Znojil, Sep 30 2020
EXTENSIONS
Terms a(13) and beyond from Andrew Howroyd, Oct 02 2020
STATUS
approved