|
|
A062764
|
|
Number of partitions of the unit square into 2^n dyadic rectangles, each of area 2^{-n}.
|
|
1
|
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
A dyadic rectangle is of the form [a2^{-b},(a+1)2^{-b}]x [c2^{-d},(c+1)2^{-d}] with a,b,c,d nonnegative integers.
The number of dyadic equipartitions of the unit cube (or higher dimensional cube) seems much more difficult.
|
|
REFERENCES
|
S. Janson, D. Randall and J. H. Spencer, Random dyadic tilings of the Unit Square, Tech Report 2001:18, Uppsala (Sweden)
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 2a(n-1)^2 - a(n-2)^4 for n >= 2.
|
|
EXAMPLE
|
a(2)=7; the 7 partitions are as follows:
(#1) 4 vertical strips;
(#2) 4 horizontal strips;
(#3) 4 squares;
(#4) 2 horizontal strips on top, two squares on bottom;
(#5) like #4, but with top/bottom reversed;
(#6) two vertical strips on left, two squares on right;
(#7) like #6, but with left/right reversed.
|
|
MAPLE
|
a:=proc(n) option remember: if n=0 then 1 elif n=1 then 2 else 2*procname(n-1)^2-procname(n-2)^4; fi; end; seq(a(n), n=0..8); # Muniru A Asiru, Jun 29 2018
|
|
PROG
|
(PARI) { for (n=0, 11, if (n, a=2*a1^2 - a2^4; a2=a1; a1=a, a=a1=1; a2=0); write("b062764.txt", n, " ", a) ) } \\ Harry J. Smith, Aug 10 2009
(GAP) a:=[1, 2];; for n in [3..9] do a[n]:=2*a[n-1]^2-a[n-2]^4; od; a; # Muniru A Asiru, Jun 29 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Joel Spencer (spencer(AT)cs.nyu.edu), Jul 16 2001
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|