This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A010928 Binomial coefficient C(12,n). 6
 1, 12, 66, 220, 495, 792, 924, 792, 495, 220, 66, 12, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Row 12 of A007318. Also number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle. This is the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves. A puzzle in the Rubik cube family. The total number of distinct positions is 4096. Here positions differing by rotations or reflections are considered distinct. If the sequence is extended by trailing zeros, its binomial transform yields A010965. - R. J. Mathar, Sep 19 2008 LINKS Jaap Scherphuis, Puzzle Pages MAPLE seq(binomial(12, n), n=0..12); # Nathaniel Johnston, Jun 23 2011 MATHEMATICA q = 12; Join[{a = 1}, Table[a = (q - n)*a/(n + 1), {n, 0, q - 1}]] (* Vladimir Joseph Stephan Orlovsky, Jul 09 2011 *) Binomial[12, Range[0, 12]] (* Harvey P. Dale, Jul 02 2018 *) PROG (Sage) [binomial(12, m) for m in range(13)] # Zerinvary Lajos, Apr 21 2009 (MAGMA) [Binomial(12, n): n in [0..12]]; // Vincenzo Librandi, Jun 12 2013 CROSSREFS Cf. A010926-A011001, A080560-A080564. Sequence in context: A296914 A285580 A001490 * A080559 A284641 A226235 Adjacent sequences:  A010925 A010926 A010927 * A010929 A010930 A010931 KEYWORD nonn,fini,full,easy AUTHOR EXTENSIONS Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, Jun 15 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.

Last modified April 20 03:36 EDT 2019. Contains 322294 sequences. (Running on oeis4.)