A297230 Number of edge covers in the n-Sierpinski tetrahedron graph.

41, 9184547, 30256134414279802201335099139, 3545937976119026560460074525919283528343785996978360450767323381089387465766795692339515739830393470859321491212835

Offset

1,1

Links

Christian Sievers, Table of n, a(n) for n = 1..5

Eric Weisstein's World of Mathematics, Edge Cover

Eric Weisstein's World of Mathematics, Sierpinski Tetrahedron Graph

Prog

(PARI) a(n)={my(s=[1, 0, 1, 4, 41]); for(k=2, n, s=vector(5, i, sum(wx=1, 3, sum(wy=1, 3, sum(wz=1, 3, sum(xy=1, 3, sum(xz=1, 3, sum(yz=1, 3, s[1+(i>1)+(wx%2)+(wy%2)+(wz%2)]*s[1+(i>2)+(wx\2)+(xy%2)+(xz%2)]*s[1+(i>3)+(wy\2)+(xy\2)+(yz%2)]*s[1+(i>4)+(wz\2)+(xz\2)+(yz\2)])))))))); s[5]} \\ Christian Sievers, Jul 20 2024

Crossrefs

Sequence in context: A286915 A297056 A292070 * A087512 A297055 A228555

Adjacent sequences: A297227 A297228 A297229 * A297231 A297232 A297233

Keyword

nonn

Author

Eric W. Weisstein, Dec 27 2017

Extensions

a(3) and beyond from Christian Sievers, Jul 20 2024

Status

approved