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.

A345889 Number of tilings of an n-cell circular array with rectangular tiles of any size, and where the number of possible colors of a tile is given by the smallest cell covered.

Original entry on oeis.org

1, 4, 16, 76, 436, 2956, 23116, 204556, 2018956, 21977356, 261478156, 3374988556, 46964134156, 700801318156, 11162196262156, 189005910310156, 3390192763174156, 64212742967590156, 1280663747055910156, 26826134832910630156, 588826498721714470156
Offset: 1

Views

Author

Lara Pudwell, Jun 28 2021

Keywords

Crossrefs

Partial differences give A001710.

Programs

Formula

a(n) = Sum_{k=2..n+1} k!/2.
a(n) = A054116(n+1)/2.
a(n) = a(n-1) + A001710(n+1).
a(n) = A014288(n+1) - 1 = A003422(n+2)/2 - 1. - Alois P. Heinz, Jun 28 2021
a(n) ~ n*n!/2. - Stefano Spezia, Jun 29 2021