Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036500
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036500 Number of inequivalent cyclic Hadamard difference sets with parameters (2^n-1, 2^(n-1)-1, 2^(n-2)-1). +0
1
1, 1, 1, 1, 2, 2, 6, 4, 5, 10 (list; graph; listen)
OFFSET

1,5

REFERENCES

P. Gaal (gaal(AT)scf.usc.edu) and S. W. Golomb, Exhaustive determination of (1023,511,255) cyclic Hadamard difference sets, Math. Comp. Math. Comp. 70 (2001), no. 233, 357-366.

CROSSREFS

Sequence in context: A059943 A112336 A028390 this_sequence A077080 A081111 A092686

Adjacent sequences: A036497 A036498 A036499 this_sequence A036501 A036502 A036503

KEYWORD

nonn,nice,hard

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research