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.

A104768 Number of matrices G with entries in Z satisfying G^2=G+1 and having the form 2G=[1+p q-2n | q+2n 1-p].

Original entry on oeis.org

8, 4, 0, 8, 0, 0, 8, 0, 8, 0, 8, 0, 0, 0, 0, 16, 0, 0, 8, 0, 0, 16, 0, 0, 8, 0, 0, 0, 8, 0, 0, 0, 0, 8, 0, 16, 8, 0, 0, 8, 0, 0, 0, 0, 0, 16, 8, 0, 8, 0, 0, 0, 0, 8, 0, 16, 0, 8, 0, 0, 0, 0, 8, 8, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 16, 8, 8, 0, 8, 0, 0, 0, 0, 0, 16, 8, 0, 0, 0, 0, 0, 0, 0, 8, 0
Offset: 0

Views

Author

Michele Dondi (blazar(AT)lcm.mi.infn.it), Mar 24 2005

Keywords

Comments

The matrix solutions to G^2=G+1 are gI, g'I (where g is the golden number and g'=1-g) and the matrices 2G=[1+p q-B | q+B 1-p]. It is easy to see that B must be even.

Crossrefs

Cf. A104767.

Formula

a(n)=8*104767(n) if n != 1, a(1)=4.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.