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-1 of 1 results.

A354763 a(n) is the minimum number of square tiles needed for constructing a figure whose corresponding graph has n cycles.

Original entry on oeis.org

0, 4, 7, 6, 9, 12, 8, 11, 14, 13, 10, 13, 16, 15, 18, 12, 15, 18, 17, 20, 23, 14, 17, 20, 19, 22, 25, 21, 16, 19, 22, 21, 24, 27, 23, 26, 18, 21, 24, 23, 26, 29, 25, 28, 31, 20, 23, 26, 25, 28, 31, 27, 30, 33, 32, 22, 25, 28, 27, 30, 33, 29, 32, 35, 34, 31, 24
Offset: 0

Views

Author

Stefano Spezia, Jun 06 2022

Keywords

Comments

The square tiles are connected only at corners.

Crossrefs

Programs

  • Mathematica
    r[n_]:=First[IntegerPartitions[n,All,Table[k(k+1)/2,{k,Sqrt[1+8n]}]]]; (* A354762 *)
    Join[{0}, Table[1+Sum[Sqrt[1+8Part[r[n],i]],{i,Length[r[n]]}],{n,66}]]

Formula

a(n) = 1 + Sum_{i=1..A057945(n)} sqrt(1 + 8*A354762(n, i)) for n > 0.
a(A000217(n)) = A163300(n+1).
Showing 1-1 of 1 results.