login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A358357 Maximum length of an induced path (or chordless path) in the n-folded cube graph. 2

%I #14 Dec 24 2022 11:15:45

%S 1,1,2,4,10,22

%N Maximum length of an induced path (or chordless path) in the n-folded cube graph.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FoldedCubeGraph.html">Folded Cube Graph</a>.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Folded_cube_graph">Folded cube graph</a>.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Induced_path">Induced path</a>.

%F a(n) >= A358358(n)-2. Equality holds for 3 <= n <= 7.

%F For n > 2, a(n) <= (2^(n-2)*n-1)/(n-1)-1. - _Elijah Beregovsky_, Dec 22 2022

%Y Cf. A099155, A357619, A358355, A358358.

%K nonn,more

%O 2,3

%A _Pontus von Brömssen_, Nov 12 2022

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 21:18 EDT 2024. Contains 371281 sequences. (Running on oeis4.)