Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075691
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075691 Let M(k) be the kxk matrix m_(i,j) = i (modj) - j (modi); then a(n)=det(M(2*n)). +0
1
1, 1, 81, 81, 53361, 57744801, 119836809, 3231369355201, 3030985307728225, 1788629609520903241, 6271587203171610961, 566023524795406585035241, 135075661787247287434787209, 202466242679530681259970248569 (list; graph; listen)
OFFSET

1,3

COMMENT

Terms are squares. det(M(2*n+1))=0.

PROGRAM

(PARI) a(n)=matdet(matrix(2*n, 2*n, i, j, i%j-j%i))

CROSSREFS

Sequence in context: A033401 A087410 A090292 this_sequence A055390 A089784 A124968

Adjacent sequences: A075688 A075689 A075690 this_sequence A075692 A075693 A075694

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 12 2002

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research