This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A010928 #30 Sep 08 2022 08:44:37
%S A010928 1,12,66,220,495,792,924,792,495,220,66,12,1
%N A010928 Binomial coefficient C(12,n).
%C A010928 Row 12 of A007318.
%C A010928 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.
%C A010928 If the sequence is extended by trailing zeros, its binomial transform yields A010965. - _R. J. Mathar_, Sep 19 2008
%H A010928 Jaap Scherphuis, <a href="http://www.jaapsch.net/puzzles/">Puzzle Pages</a>
%p A010928 seq(binomial(12,n), n=0..12); # _Nathaniel Johnston_, Jun 23 2011
%t A010928 q = 12; Join[{a = 1}, Table[a = (q - n)*a/(n + 1), {n, 0, q - 1}]] (* _Vladimir Joseph Stephan Orlovsky_, Jul 09 2011 *)
%t A010928 Binomial[12,Range[0,12]] (* _Harvey P. Dale_, Jul 02 2018 *)
%o A010928 (Sage) [binomial(12,m) for m in range(13)] # _Zerinvary Lajos_, Apr 21 2009
%o A010928 (Magma) [Binomial(12, n): n in [0..12]]; // _Vincenzo Librandi_, Jun 12 2013
%Y A010928 Cf. A010926-A011001, A080560-A080564.
%K A010928 nonn,fini,full,easy
%O A010928 0,2
%A A010928 _N. J. A. Sloane_
%E A010928 Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, Jun 15 2007