The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095028 An example of a (v,k,lambda)=(11,5,2) cyclic difference set. 1
 1, 3, 4, 5, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS See A095029. LINKS Dan Gordon, List of Cyclic Difference Sets, (2003). EXAMPLE Using the numbers {1 3 4 5 9}, every number in the range 1..10 can be written as a difference modulo 11 in two different ways: 1=4-3=5-4, 2=3-1=5-3, 3=4-1=(1-9) mod 11, 4=5-1=9-5, 5=9-4=(3-9) mod 11, 6=9-2=(4-9) mod 11, 7=(1-5) mod 11=(5-9) mod 11, 8=9-1=(1-4) mod 11, 9=(1-3) mod 11=(3-5) mod 11, 10=(3-4) mod 11=(4-5) mod 11. CROSSREFS Cf. A095025 number of cyclic difference sets with n elements, A095029 .. A095047 more examples of cyclic difference set with k=5..53. Sequence in context: A058983 A261208 A010375 * A011246 A166715 A330577 Adjacent sequences:  A095025 A095026 A095027 * A095029 A095030 A095031 KEYWORD fini,full,nonn AUTHOR Hugo Pfoertner, Jun 02 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 25 18:38 EDT 2022. Contains 354851 sequences. (Running on oeis4.)