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.

A099369 Squares of A041025(n-1), n>=1, (generalized Fibonacci).

Original entry on oeis.org

0, 1, 64, 4225, 278784, 18395521, 1213825600, 80094094081, 5284996383744, 348729667233025, 23010873040995904, 1518368891038496641, 100189335935499782400, 6610977802851947141761, 436224345652293011573824
Offset: 0

Views

Author

Wolfdieter Lang, Oct 18 2004

Keywords

Comments

See the comment in A099279. This is example a=8.
a(n+1) is the number of tilings of an n-board (a board with dimensions n X 1) using half-squares (1/2 X 1 pieces, always placed so that the shorter sides are horizontal) and (1/2,1/2)-fences if there are 8 kinds of half-squares available. A (w,g)-fence is a tile composed of two w X 1 pieces separated horizontally by a gap of width g. a(n+1) also equals the number of tilings of an n-board using (1/4,1/4)-fences and (1/4,3/4)-fences if there are 8 kinds of (1/4,1/4)-fences available. - Michael A. Allen, Apr 30 2023

Crossrefs

Cf. other squares of k-metallonacci numbers (for k=1 to 10): A007598, A079291, A092936, A099279, A099365, A099366, A099367, this sequence, A099372, A099374.

Programs

  • Mathematica
    LinearRecurrence[{65,65,-1},{0,1,64},20] (* Harvey P. Dale, Oct 05 2021 *)

Formula

a(n) = A041025(n-1)^2, n >= 1, a(0)=0.
a(n) = 65*a(n-1) + 65*a(n-2) - a(n-3), n >= 3; a(0)=0, a(1)=1, a(2)=64.
a(n) = 66*a(n-1) - a(n-2) - 2*(-1)^n, n >= 2; a(0)=0, a(1)=1.
a(n) = (T(n, 33) - (-1)^n)/34 with the Chebyshev polynomials of the first kind: T(n, 33) = A099370(n).
G.f.: x*(1-x)/((1-66*x+x^2)*(1+x)) = x*(1-x)/(1-65*x-65*x^2+x^3).
a(n) = (1 - (-1)^n)/2 + 64*Sum_{r=1..n-1} r*a(n-r). - Michael A. Allen, Apr 30 2023
Product_{n>=2} (1 + (-1)^n/a(n)) = (4 + sqrt(17))/8 (Falcon, 2016, p. 189, eq. (3.1)). - Amiram Eldar, Dec 03 2024