Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049527
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049527 Number of possible sets {{row sums},{column sums}} of an n X n+1 matrix with entries from {0,1,-1} and all row and column sums distinct. +0
3
1, 2, 3, 6, 10, 22, 39, 94, 174, 464, 886, 2610 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A049475, A049526.

Adjacent sequences: A049524 A049525 A049526 this_sequence A049528 A049529 A049530

Sequence in context: A014270 A127076 A137208 this_sequence A074371 A032202 A125702

KEYWORD

nonn,hard,nice

AUTHOR

Michael Kleber (kleber(AT)brandeis.edu)

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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research