A367701 Number of degree 3 vertices in the n-Menger sponge graph.
8, 152, 2744, 49688, 941624, 18381464, 363917240, 7248334616, 144725667128, 2892582307736, 57836189374136, 1156600107729944, 23131012640050232, 462612336455034008, 9252183397644168632, 185043161299165038872, 3700859172747355380536, 74017151029040948253080
Offset: 1
Examples
The level 1 Menger sponge graph is a cube with each edge subdivided, which has 12 degree 2 vertices and 8 degree 3 vertices. Thus a(1) = 8.
Links
- Allan Bickle, Degrees of Menger and Sierpinski Graphs, Congr. Num. 227 (2016) 197-208.
- Allan Bickle, MegaMenger Graphs, The College Mathematics Journal, 49 1 (2018) 20-26.
- Eric Weisstein's World of Mathematics, Menger Sponge Graph.
- Index entries for linear recurrences with constant coefficients, signature (32,-275,724,-480).
Crossrefs
Programs
-
Mathematica
LinearRecurrence[{32,-275,724,-480},{8,152,2744,49688},25] (* Paolo Xausa, Nov 28 2023 *)
-
Python
def A367701(n): return ((3*5**n<<(n<<1)+3)+(51<<(3*n+1))-(3**(n+3)<<4))//85+8 # Chai Wah Wu, Nov 28 2023
Formula
a(n) = (24/85)*20^n + (6/5)*8^n - (432/85)*3^n + 8.
a(n) = 20*a(n-1) - (9/5)*8^n + (144/5)*3^n - 152.
G.f.: 8*x*(1 - 13*x + 10*x^2 - 264*x^3)/((1 - x)*(1 - 3*x)*(1 - 8*x)*(1 - 20*x)). - Stefano Spezia, Nov 27 2023
Comments