Summary of block A318
Sequences in block A318
Section titled “Sequences in block A318”-
A318159: Figurate numbers based on the small stellated dodecahedron: a(n) = n*(21*n^2 - 33*n + 14)/2.
-
A318165: The n^n dots problem: minimal number of straight lines (connected at their endpoints) required to pass through n^n dots arranged in an n X n X … X n grid.
-
A318234: Number of inequivalent leaf-colorings of totally transitive rooted trees with n nodes.
-
A318236: a(n) = (3*2^(4*n+3) + 1)/5.
-
A318609: a(1) = 2, a(2) = 4, a(3) = 6; for n > 3, a(n) = 3*a(n-1) - 3*a(n-2) + 9*a(n-3).
-
A318618: a(n) is the number of rooted forests on n nodes that avoid the patterns 321, 2143, and 3142.
-
A318623: a(n) = 2^phi(n) mod n.
-
A318765: a(n) = (n + 2)*(n^2 + n - 1).
-
A318778: Number of different positions that an elementary sphinx can occupy in a sphinx of order n.
-
A318895: Number of isoclinism classes of the groups of order 2^n.
-
A318970: a(1) = 3; for n > 1, a(n) = 2^(a(n-1) - 1) + 5.
-
A318972: The 7x+-1 function (“shortcut” definition): a(n) = (7n+1)/4 if n == +1 (mod 4), a(n) = (7n-1)/4 if n == -1 (mod 4), otherwise a(n) = n/2.