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.

Showing 1-2 of 2 results.

A348461 Size of largest bipartite biregular Moore graph of diameter 4 and degrees n and n.

Original entry on oeis.org

8, 30, 80, 170, 312
Offset: 2

Views

Author

N. J. A. Sloane, Oct 31 2021

Keywords

Comments

a(7) >= 516, a(8) = 800, a(9) = 1170, a(10) = 1640.

Crossrefs

Formula

Empirical observation: For the terms a(2)-a(6) and a(8)-a(10) a(n) = 2*(A027444(n-1) + 1). It is unknown whether this is also valid for n = 7 and n > 10. - Hugo Pfoertner, Oct 31 2021
Is this the same as 2*A053698(n-1)? If not, where is the first place these sequences differ? - Omar E. Pol, Oct 31 2021
a(n) <= 2*A053698(n-1) (the Moore bound). - Pontus von Brömssen, Oct 31 2021

A348462 Size of largest bipartite biregular Moore graph of diameter 6 and degrees n and 2.

Original entry on oeis.org

12, 35, 78, 147, 248
Offset: 2

Views

Author

N. J. A. Sloane, Oct 31 2021

Keywords

Comments

a(7) >= 387, a(8) = 570, a(9) = 803, a(10) = 1092.

Crossrefs

Formula

Empirical observation: For the terms a(2)-a(6) and a(8)-a(10) a(n) = A081437(n-1) + 2. It is unknown whether this is also valid for n = 7 and for n > 10. - Hugo Pfoertner, Oct 31 2021
a(n) <= A027620(n-2) + 3 = A081437(n-1) + 2 (the Moore bound). - Pontus von Brömssen, Oct 31 2021
Showing 1-2 of 2 results.