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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A216732 Conjectural order of largest subgraph of diameter n of the two-dimensional mesh with maximal degree 3. 0

%I

%S 4,6,10,14,22,28,37,44,52,68,77,90,104,124,135

%N Conjectural order of largest subgraph of diameter n of the two-dimensional mesh with maximal degree 3.

%C I do not know how many of these terms have been proved to be correct.

%H Mirka Miller, Hebert Perez-Roses, and Joe Ryan, <a href="http://arxiv.org/abs/1203.4069">The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh</a>, arXiv preprint arXiv:1203.4069, 2012.

%K nonn

%O 2,1

%A _N. J. A. Sloane_, Sep 17 2012

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 December 10 12:15 EST 2019. Contains 329895 sequences. (Running on oeis4.)