This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A106512 Array read by antidiagonals: a(n,k) = number of k-colorings of a circle of n nodes (n >= 1, k >= 1). 3
 0, 0, 0, 0, 2, 0, 0, 6, 0, 0, 0, 12, 6, 2, 0, 0, 20, 24, 18, 0, 0, 0, 30, 60, 84, 30, 2, 0, 0, 42, 120, 260, 240, 66, 0, 0, 0, 56, 210, 630, 1020, 732, 126, 2, 0, 0, 72, 336, 1302, 3120, 4100, 2184, 258, 0, 0, 0, 90, 504, 2408, 7770, 15630, 16380, 6564, 510, 2, 0, 0, 110 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Note that we keep one edge in the circular graph even when there's only one node (so there are 0 colorings of one node with k colors). Number of closed walks of length n on the complete graph K_{k}. - Andrew Howroyd, Mar 12 2017 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..1274 FORMULA a(n, k) = (k-1)^n + (-1)^n * (k-1). EXAMPLE From Andrew Howroyd, Mar 12 2017: (Start) Table starts: 0 0   0     0      0       0        0        0         0 ... 0 2   6    12     20      30       42       56        72 ... 0 0   6    24     60     120      210      336       504 ... 0 2  18    84    260     630     1302     2408      4104 ... 0 0  30   240   1020    3120     7770    16800     32760 ... 0 2  66   732   4100   15630    46662   117656    262152 ... 0 0 126  2184  16380   78120   279930   823536   2097144 ... 0 2 258  6564  65540  390630  1679622  5764808  16777224 ... 0 0 510 19680 262140 1953120 10077690 40353600 134217720 ... (End) a(4,3) = 18 because there are three choices for the first node's color (call it 1) and then two choices for the second node's color (call it 2) and then the remaining two nodes can be 12, 13, or 32. So in total there are 3*2*3 = 18 ways. a(3,4) = 4*3*2 = 24 because the three nodes must be three distinct colors. CROSSREFS Columns include A092297, A226493. Main diagonal is A118537. Rows 2-7 are A002378, A007531, A091940, A061167, A131472, A133499. Cf. A090860, A208535. Sequence in context: A128711 A259857 A132710 * A181229 A094785 A265856 Adjacent sequences:  A106509 A106510 A106511 * A106513 A106514 A106515 KEYWORD nonn,tabl AUTHOR Joshua Zucker, May 29 2005 EXTENSIONS a(67) corrected by Andrew Howroyd, Mar 12 2017 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 August 23 11:24 EDT 2019. Contains 326222 sequences. (Running on oeis4.)