Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037256
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A037256 Solution to "Unfriendly Seating Arrangement" problem. +0
3
0, 1, 2, 10, 48, 296, 2080, 16752, 151424, 1519744, 16766208, 201685760, 2627316736, 36847260672, 553551644672, 8868624615424, 150943592939520, 2719816264613888, 51724646086475776, 1035359388788391936 (list; graph; listen)
OFFSET

0,3

REFERENCES

SIAM Review, Problem 62-3, 1962, pp. 180ff.

LINKS

Philippe Flajolet, A SEATING ARRANGEMENT PROBLEM

FORMULA

E.g.f.: (1-exp(-2*x))*(1-x)^(-2)/2.

CROSSREFS

Sequence in context: A036918 A166922 A129118 this_sequence A052576 A143147 A015945

Adjacent sequences: A037253 A037254 A037255 this_sequence A037257 A037258 A037259

KEYWORD

nonn

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research