login
A297532
Number of maximum matchings in the n-Sierpinski sieve graph.
1
3, 2, 144, 8192, 69269232549888, 2658455991569831745807614120560689152, 20629598047085351073781197562197536448467995509610681744292843893938924076606720567385132001811808287432516829184
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Matching
Eric Weisstein's World of Mathematics, Maximum Independent Edge Set
Eric Weisstein's World of Mathematics, Sierpinski Sieve Graph
PROG
(PARI) rd(p)=if(p, pollead(p)*x^poldegree(p), 0);
a(n)={my(s=[1, 0, x, 0]); for(k=2, n, s=vector(4, i, sum(xy=0, 2, sum(xz=0, 2, sum(yz=0, 2, rd(s[1+(i>1)+(xy%2)+(xz%2)]*s[1+(i>2)+(xy\2)+(yz%2)]*s[1+(i>3)+(xz\2)+(yz\2)])))))); pollead([1, 3, 3, 1]*s~)} \\ Christian Sievers, Jul 21 2024
CROSSREFS
Sequence in context: A244083 A303683 A187825 * A369990 A037057 A065585
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Dec 31 2017
EXTENSIONS
a(5) and beyond from Christian Sievers, Jul 21 2024
STATUS
approved