login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0
1, 2, 1, 4, 2, 2, 8, 4, 4, 2, 16, 8, 8, 5, 4, 32, 16, 16, 10 (list; table; graph; refs; listen; history; text; internal format)
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: A094571 A316477 A104733 * A153281 A130584 A265911

Adjacent sequences:  A201700 A201701 A201702 * A201704 A201705 A201706

KEYWORD

nonn,more,tabl

AUTHOR

N. J. A. Sloane, Dec 04 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 05:51 EDT 2019. Contains 327212 sequences. (Running on oeis4.)