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”).

A378591
Number of edge cuts in the n-Sierpinski gasket graph.
1
4, 352, 120905728, 2407558186389936749412352, 14134769792236367387238791435785519303295716096758551664972849610340958208
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Edge Cut.
Eric Weisstein's World of Mathematics, Sierpinski Gasket Graph.
PROG
(PARI) a(n)={my(c0=1, c2=1, c3=4); for(k=2, n, [c0, c2, c3]=[12*c0*c2*c3+14*c2^3+3*c2^2*c3, c0*c3^2+7*c2^2*c3+c2*c3^2, 6*c2*c3^2+c3^3]); 2^3^n-c3} \\ Christian Sievers, Dec 04 2024
CROSSREFS
Sequence in context: A225207 A052391 A377772 * A377538 A214182 A214233
KEYWORD
nonn,new
AUTHOR
Eric W. Weisstein, Dec 01 2024
EXTENSIONS
a(4) and beyond from Christian Sievers, Dec 04 2024
STATUS
approved