The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323425 Number of ways n people in a line can each choose two others both on the same side of them. 7
 1, 0, 0, 0, 9, 648, 57600, 6615000, 972504225, 179499220992, 40789783609344, 11212877910528000, 3671848787797265625, 1413385410212064432000, 632129969391038455873536, 325176984737061807515098752, 190691488202627199302740850625, 126479088749202444199526400000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS FORMULA a(n) = Product_{k = 1..n} ( binomial(k-1, 2) + binomial(n-k, 2) ). a(n) ~ exp(Pi*(n/2 - 1) - 2*n) * n^(2*n) / 2^n. - Vaclav Kotesovec, Jan 15 2019 EXAMPLE Example: For n = 4, with four people ABCD, A can choose any two of {B, C, D} (3 choices), B can choose {C, D} (1 choice), C can choose {A, B} (1 choice), and D can choose any two of {A, B, C} (3 choices), so there are 3*1*1*3=9 possible overall choices and a(4) = 9. Example: For n = 5, with five people ABCDE, A can choose any two of {B, C, D, E} (6 choices), B can choose any two of {C, D, E} (3 choices), C can choose either {A, B} or {D, E} (2 choices), D can choose any two of {A, B, C} (3 choices), E can choose any two of {A, B, C, D} (6 choices), so a(5) = 6*3*2*3*6 = 648. MATHEMATICA Table[Product[Binomial[k-1, 2] + Binomial[n-k, 2], {k, 1, n}], {n, 0, 20}] (* Vaclav Kotesovec, Jan 15 2019 *) PROG (Haskell) a n = product [(k-1)*(k-2) `div` 2 + (n-k)*(n-k-1) `div` 2 | k<-[1..n]] CROSSREFS Sequence in context: A280904 A210053 A128795 * A191510 A081232 A020548 Adjacent sequences:  A323422 A323423 A323424 * A323426 A323427 A323428 KEYWORD nonn AUTHOR Shreevatsa R, Jan 14 2019 EXTENSIONS More terms from Vaclav Kotesovec, Jan 15 2019 STATUS approved

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

Last modified October 19 15:05 EDT 2021. Contains 348091 sequences. (Running on oeis4.)
{"ft_lang_label":"__label__en","ft_lang_prob":0.5849732,"math_prob":0.94684213,"size":1789,"snap":"2021-43-2021-49","text_gpt3_token_len":744,"char_repetition_ratio":0.15126051,"word_repetition_ratio":0.0990991,"special_character_ratio":0.55897146,"punctuation_ratio":0.21717171,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9787222,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-19T19:06:38Z\",\"WARC-Record-ID\":\"<urn:uuid:e6a76f9d-5214-4aec-b35a-052e52e41ddc>\",\"Content-Length\":\"16214\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:12a06eca-397c-458d-ae02-79d07209814b>\",\"WARC-Concurrent-To\":\"<urn:uuid:47203e71-992c-4ae3-bb1f-e3911f145bde>\",\"WARC-IP-Address\":\"104.239.138.29\",\"WARC-Target-URI\":\"https://oeis.org/A323425\",\"WARC-Payload-Digest\":\"sha1:HIW3LQCJEUCX2X2JMWVBLR5NC7TJ73CS\",\"WARC-Block-Digest\":\"sha1:EE4DTCIF25CYFIMX5K4AHAKIH4PDWN3S\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585280.84_warc_CC-MAIN-20211019171139-20211019201139-00091.warc.gz\"}"}