A297564 Number of maximum matchings in the n-Hanoi graph.
3, 12, 240, 344064, 135239930216448, 972994892914558418965586768125212229632, 41146466050197558152623700055749184719621958256873764134791737821244302120007939929484006451701147677119500779520
Offset: 1
Keywords
Links
- Christian Sievers, Table of n, a(n) for n = 1..9
- Eric Weisstein's World of Mathematics, Hanoi Graph.
- Eric Weisstein's World of Mathematics, Matching.
- Eric Weisstein's World of Mathematics, Maximum Independent Edge Set.
Programs
-
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,rd(sum(xy=0,3,sum(xz=0,3,sum(yz=0,3,s[1+(i>1)+(xy%2)+(xz%2)]*s[1+(i>2)+(xy\2)+(yz%2)]*s[1+(i>3)+(xz\2)+(yz\2)]*x^(!xy+!xz+!yz)))))));pollead([1,3,3,1]*s~) \\ Christian Sievers, May 13 2025
Extensions
a(5) and beyond from Christian Sievers, May 13 2025