cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A212596 Number of cards required to build a Menger sponge of level n in origami.

Original entry on oeis.org

12, 192, 3456, 66048, 1296384, 25731072, 513048576, 10248388608, 204867108864, 4096536870912, 81924294967296, 1638434359738368, 32768274877906944, 655362199023255552, 13107217592186044416, 262144140737488355328, 5242881125899906842624
Offset: 0

Views

Author

Daniel de Rauglaudre, May 22 2012

Keywords

Examples

			12 cards (a(0)) are required for a single origami cube: 6 for the cube skeleton, and 6 for panels or possible links to other cubes.
		

Crossrefs

Cf. A082685.

Programs

Formula

a(n) = 4*(8^n + 2*20^n) = 2^(2*n+3)*5^n+2^(3*n+2).
a(n) = A082685(n)*3*4^(n+1).
From Colin Barker, Apr 10 2014: (Start)
a(n) = 28*a(n-1)-160*a(n-2).
G.f.: -12*(12*x-1) / ((8*x-1)*(20*x-1)). (End)

Extensions

More terms from Colin Barker, Apr 10 2014