Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104768
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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]. +0
3
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 (list; graph; listen)
OFFSET

0,1

COMMENT

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.

FORMULA

a(n)=8*104767(n) if n != 1, a(1)=4.

CROSSREFS

Cf. A104767.

Sequence in context: A114313 A096616 A103613 this_sequence A049255 A028577 A039662

Adjacent sequences: A104765 A104766 A104767 this_sequence A104769 A104770 A104771

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research