Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060963
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060963 Number of pairings of the first 2n integers so that the differences of each pair are different. +0
2
1, 1, 5, 29, 145, 957, 8397, 85169, 944221, 11639417, 160699437, 2430145085, 39776366397 (list; graph; listen)
OFFSET

0,3

COMMENT

Number of perfect Skolem-type sequences.

LINKS

G. Nordh, Perfect Skolem sequences

EXAMPLE

a(3)=5 since the 5 pairings of {1, 2, 3, 4, 5, 6} are: {1, 3} {2, 6} {4, 5}, {1, 5} {2, 3} {4, 6}, {1, 5} {2, 4} {3, 6}, {1, 4} {2, 6} {3, 5}, {1, 6} {2, 5} {3, 4}

CROSSREFS

Sequence in context: A034332 A146053 A163082 this_sequence A107002 A027864 A065541

Adjacent sequences: A060960 A060961 A060962 this_sequence A060964 A060965 A060966

KEYWORD

nonn

AUTHOR

Erich Friedman (efriedma(AT)stetson.edu), May 08 2001

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 December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research