A201703 Triangle read by rows: T(n,m) (0 <= m <= n) = size of smallest set of nodes whose removal from an n-dimensional hypercube leaves no subgraph isomorphic to an m-dimensional Fibonacci cube.

1, 2, 1, 4, 2, 2, 8, 4, 4, 2, 16, 8, 8, 5, 4, 32, 16, 16, 10

Offset

0,2

Links

Table of n, a(n) for n=0..18.

Petr Gregor, Recursive fault-tolerance of Fibonacci cube in hypercubes, Discrete Math. 306 (2006), no. 13, 1327-1341.

Example

Triangle begins:
1
2 1
4 2 2
8 4 4 2
16 8 8 5 4
32 16 16 10 8-10 6
64 32 32 21 16-20 12 8
...

Crossrefs

Sequence in context: A316477 A104733 A348676 * A153281 A338654 A130584

Adjacent sequences: A201700 A201701 A201702 * A201704 A201705 A201706

Keyword

nonn,more,tabl

Author

N. J. A. Sloane, Dec 04 2011

Status

approved