login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126429 Number of permutations of the numbers 1 through 2n satisfying the "Alex Fink" condition: there is one and only one partial sum in each interval (k(n+1),(k+1)(n+1)] for 0<=k<2n-1. 5
2, 8, 96, 1344, 30880, 957696, 38918656, 1923336192 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

R. K. Guy, Building Barrycades, preprint, 2006

LINKS

Table of n, a(n) for n=1..8.

EXAMPLE

a(2)=8 since there are eight permutations of (1,2,3,4) satisfying the Fink condition: (1,3,4,2), (1,4,2,3), (1,4,3,2), (2,4,1,3) and their mirror images.

CROSSREFS

Sequence in context: A295773 A319125 A297688 * A098272 A087540 A052713

Adjacent sequences:  A126426 A126427 A126428 * A126430 A126431 A126432

KEYWORD

more,nonn

AUTHOR

Kevin Saff (kevin.saff(AT)gmail.com), Mar 11 2007

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 08:47 EDT 2019. Contains 328292 sequences. (Running on oeis4.)