A367701 -id:A367701 - cp's OEIS frontend

A367700 Number of degree 2 vertices in the n-Menger sponge graph.

12, 72, 744, 11256, 201960, 3871416, 76138536, 1512609912, 30171384168, 602782587960, 12050495247528, 240968665611768, 4819043435788776, 96378229818994104, 1927543485550004520, 38550700825394191224, 771012665426135994984, 15420242499878035355448, 308404763528431125030312

Offset: 1

Allan Bickle, Nov 27 2023

The level 0 Menger sponge graph is a single vertex. The level n Menger sponge graph is formed from 20 copies of level n-1 in the shape of a cube with middle faces removed by joining boundary vertices between adjacent copies.

			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) = 12.

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 (31,-244,480).

Cf. A009964 (number of vertices), A291066 (number of edges).
Cf. A359452, A359453 (numbers of corner and non-corner vertices).
Cf. A083233, A332705 (surface area).
Cf. A367701, A367702, A367706, A367707 (degrees 2 through 6).
Cf. A001018, A271939, A365602, A365606, A365607, A365608 (Sierpinski carpet graphs).

LinearRecurrence[{31,-244,480}, {12, 72, 744}, 25] (* Paolo Xausa, Nov 28 2023 *)

def A367700(n): return (5*20**n+(34<<3*n)+216*3**n)//85 # Chai Wah Wu, Nov 27 2023

a(n) = (1/17)*20^n + (2/5)*8^n + (216/85)*3^n.
a(n) = 20*a(n-1) - (3/5)*8^n - (72/5)*3^n.
a(n) = 20^n - A367701(n) - A367702(n) - A367706(n) - A367707(n).
2*a(n) = 2*A291066(n) - 3*A367701(n) - 4*A365602(n) - 5*A367706(n) - 6*A367707(n).
G.f.: 12*x*(1 - 25*x + 120*x^2)/((1 - 3*x)*(1 - 8*x)*(1 - 20*x)). - Stefano Spezia, Nov 27 2023

A367702 Number of degree 4 vertices in the n-Menger sponge graph.

Original entry on oeis.org

0, 144, 2784, 57552, 1180320, 23889936, 480221280, 9624275280, 192645717024, 3854200280208, 77094305873376, 1541968557881808, 30840030795738528, 616805893363960080, 12336160087905835872, 246723539526229152336, 4934473492678780614432, 98689491470837087102352

Offset: 1

Allan Bickle, Nov 27 2023

The level 0 Menger sponge graph is a single vertex. The level n Menger sponge graph is formed from 20 copies of level n-1 in the shape of a cube with middle faces removed by joining boundary vertices between adjacent copies.

			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) = 0.

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.
Index entries for linear recurrences with constant coefficients, signature (32,-275,724,-480).

Cf. A009964 (number of vertices), A291066 (number of edges).
Cf. A359452, A359453 (numbers of corner and non-corner vertices).
Cf. A291066, A083233, A332705 (surface area).
Cf. A367700, A367701, A367702, A367706, A367707 (degrees 2 through 6).
Cf. A001018, A271939, A365606, A365607, A365608 (Sierpinski carpet graphs).

LinearRecurrence[{32,-275,724,-480},{0,144,2784,57552},25] (* Paolo Xausa, Nov 29 2023 *)

def A367702(n): return ((5**n<<(n<<1)+5)-(17<<(3*n+2))+(3**(n+4)<<3))//85-24 # Chai Wah Wu, Nov 28 2023

a(n) = (32/85)*20^n - (4/5)*8^n + (648/85)*3^n - 24.
a(n) = 20*a(n-1) + (6/5)*8^n - (216/5)*3^n + 456.
a(n) = 20^n - A367700(n) - A367701(n) - A367706(n) - A367707(n).
4*a(n) = 2*A291066(n) - 2*A367700(n) - 3*A367701(n) - 5*A367706(n) - 6*A367707(n).
G.f.: 12*x^2*(7 - 224*x + 1865*x^2 - 4308*x^3)/(5*(1 - x)*(1 - 3*x)*(1 - 8*x)*(1 - 20*x)). - Stefano Spezia, Nov 28 2023

A367706 Number of degree 5 vertices in the n-Menger sponge graph.

Original entry on oeis.org

0, 24, 1272, 27192, 537720, 10638648, 211640184, 4223114808, 84382898808, 1687017131832, 33735198879096, 674662776506424, 13492925768472696, 269855876817045816, 5397096426544159608, 107941759648376656440, 2158833841895083390584, 43176666029284877542200, 863533234116651651590520

Offset: 1

Allan Bickle, Nov 27 2023

The level 0 Menger sponge graph is a single vertex. The level n Menger sponge graph is formed from 20 copies of level n-1 in the shape of a cube with middle faces removed by joining boundary vertices between adjacent copies.

			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) = 0.

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.
Index entries for linear recurrences with constant coefficients, signature (32,-275,724,-480).

Cf. A009964 (number of vertices), A291066 (number of edges).
Cf. A359452, A359453 (numbers of corner and non-corner vertices).
Cf. A291066, A083233, A332705 (surface area).
Cf. A367700, A367701, A367702, A367706, A367707 (degrees 2 through 6).
Cf. A001018, A271939, A365606, A365607, A365608 (Sierpinski carpet graphs).

LinearRecurrence[{32,-275,724,-480},{0,24,1272,27192},25] (* Paolo Xausa, Nov 29 2023 *)

def A367706(n): return ((7*5**n<<(n<<1)+1)+(17<<(3*n+1))-(3**(n+3)<<5))//85+24 # Chai Wah Wu, Nov 28 2023

a(n) = (14/85)*20^n + (2/5)*8^n - (864/85)*3^n + 24.
a(n) = 20*a(n-1) - (3/5)*8^n + (288/5)*3^n - 456.
a(n) = 20^n - A367700(n) - A367701(n) - A367702(n) - A367707(n).
5*a(n) = 2*A291066(n) - 2*A367700(n) - 3*A367701(n) - 4*A365602(n) - 6*A367707(n).
G.f.: 24*x^2*(1 + 21*x - 288*x^2)/((1 - x)*(1- 3*x)*(1 - 8*x)*(1 - 20*x)). - Stefano Spezia, Nov 28 2023

A367707 Number of degree 6 vertices in the n-Menger sponge graph.

Original entry on oeis.org

0, 8, 456, 14312, 338376, 7218536, 148082760, 2991665384, 60074332872, 1203417692264, 24083810625864, 481799892270056, 9636987359949768, 192747663544965992, 3855016602355831368, 77100838700834961128, 1542020827252644619464, 30840448970959051746920, 616809238826486098348872

Offset: 1

Allan Bickle, Nov 27 2023

The level 0 Menger sponge graph is a single vertex. The level n Menger sponge graph is formed from 20 copies of level n-1 in the shape of a cube with middle faces removed by joining boundary vertices between adjacent copies.

			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) = 0.

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.
Index entries for linear recurrences with constant coefficients, signature (32,-275,724,-480).

Cf. A009964 (number of vertices), A291066 (number of edges).
Cf. A359452, A359453 (numbers of corner and non-corner vertices).
Cf. A291066, A083233, A332705 (surface area).
Cf. A367700, A367701, A367702, A367706, A367707 (degrees 2 through 6).
Cf. A001018, A271939, A365606, A365607, A365608 (Sierpinski carpet graphs).

LinearRecurrence[{32,-275,724,-480},{0,8,456,14312},25] (* Paolo Xausa, Nov 29 2023 *)

def A367707(n): return ((5**(n+1)<<(n<<1)+1)-(51<<(3*n+1))+(3**(n+3)<<4))//85-8 # Chai Wah Wu, Nov 28 2023

a(n) = (2/17)*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.
a(n) = 20^n - A367700(n) - A367701(n) - A367702(n) - A367706(n).
6*a(n) = 2*A291066(n) - 2*A367700(n) - 3*A367701(n) - 4*A365602(n) - 5*A367706(n).
G.f.: 8*x^2*(1 + 25*x + 240*x^2)/((1 - x)*(1 - 3*x)*(1 - 8*x)*(1 - 20*x)). - Stefano Spezia, Nov 28 2023

cp's OEIS Frontend

A367700 Number of degree 2 vertices in the n-Menger sponge graph.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

A367702 Number of degree 4 vertices in the n-Menger sponge graph.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

A367706 Number of degree 5 vertices in the n-Menger sponge graph.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

A367707 Number of degree 6 vertices in the n-Menger sponge graph.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula