The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055659 Number of (2,n)-partitions of a chain of length n^3. 2
 0, 15, 253, 1653, 6786, 21115, 54615, 123753, 253828, 481671, 858705, 1454365, 2359878, 3692403, 5599531, 8264145, 11909640, 16805503, 23273253, 31692741, 42508810, 56238315, 73477503, 94909753, 121313676, 153571575, 192678265 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a (k,n)-partition of a chain C is a chain of k intervals of C of length n. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 FORMULA a(n) = (1/2)*(n-1)*(n^2+n-1)*(n^3-2*n+2). EXAMPLE a(2)=15 because in the linearly ordered set {1,..,8} we can choose in 15 ways 2 successive blocks of 2 consecutive elements. PROG (Magma) [(1/2) *(n-1)*(n^2+n-1)*(n^3-2*n+2): n in [1..35]]; // Vincenzo Librandi, Jun 30 2011 (PARI) a(n) = (n-1)*(n^2+n-1)*(n^3-2*n+2)/2; \\ Altug Alkan, Oct 04 2018 CROSSREFS Cf. A055658. Sequence in context: A066410 A370317 A116508 * A218368 A123816 A273921 Adjacent sequences: A055656 A055657 A055658 * A055660 A055661 A055662 KEYWORD nonn AUTHOR Paolo Dominici (pl.dm(AT)libero.it), Jun 07 2000 STATUS approved

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

Last modified May 23 11:57 EDT 2024. Contains 372763 sequences. (Running on oeis4.)