Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078603
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078603 Number of ways of arranging the numbers 1..n in a circle so that adjacent numbers do not differ by 1 mod n. +0
3
1, 0, 0, 2, 6, 46, 354, 3106, 29926, 315862, 3628906, 45132474, 604534846, 8680957902, 133082437730, 2169964347282, 37505486702678, 685046187718022, 13186335387855770, 266816610979894058, 5662225862272325550 (list; graph; listen)
OFFSET

1,4

LINKS

Index entries for sequences related to shoe lacings

FORMULA

See A002816.

EXAMPLE

a(5) = 2: 1 3 5 2 4, 1 4 2 5 3; a(6) = 6: 1 4 6 2 5 3, 1 5 2 4 6 3, 1 5 3 6 2 4, 1 3 6 4 2 5, 1 4 2 6 3 5, 1 3 5 2 6 4.

CROSSREFS

Twice A002816. See also A078628.

Sequence in context: A136557 A092662 A052811 this_sequence A001587 A078537 A072444

Adjacent sequences: A078600 A078601 A078602 this_sequence A078604 A078605 A078606

KEYWORD

nonn

AUTHOR

njas, Dec 11 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