Summary of block A198
Sequences in block A198
Section titled “Sequences in block A198”-
A198017: a(n) = n*(7*n + 11)/2 + 1.
-
A198080: a(n) = (3^(3*n + 3)- 26*n - 27)/169.
-
A198082: Ceiling(n*Sqrt(5)).
-
A198274: a(n) = 13*2^n-1.
-
A198275: a(n) = 17*2^n - 1.
-
A198276: a(n) = 19*2^n-1.
-
A198297: Minimum number of clues needed to uniquely solve an n^2 X n^2 sudoku.
-
A198306: Moore lower bound on the order of a (6,g)-cage.
-
A198307: Moore lower bound on the order of a (7,g)-cage.
-
A198309: Moore lower bound on the order of a (9,g)-cage.
-
A198320: Related to construction of recursive sequences in GF(4^n).
-
A198392: a(n) = (6*n*(3*n+7)+(2*n+13)*(-1)^n+3)/16 + 1.
-
A198396: a(n) = 6^n - 6*n.
-
A198397: a(n) = 7^n - 7*n.
-
A198398: a(n) = 8^n - 8n.
-
A198399: a(n) = 9^n - 9*n.
-
A198400: a(n) = 10^n - 10*n.
-
A198401: a(n) = 8^n + n^8.
-
A198402: a(n) = 5^n * n^5.
-
A198403: a(n) = 6^n * n^6.
-
A198404: 8^n*n^8.
-
A198410: a(n) = ((3^(n-1) + 1)^3 -1)/3^n.
-
A198411: a(n)= (4^(2^n) + 2^(2^n) + 1)/7.
-
A198442: Number of sequences of n coin flips that win on the last flip, if the sequence of flips ends with (1,1,0) or (1,0,0).
-
A198473: Duplicate of A026185.
-
A198474: Number of 2n X 2 0..2 arrays with values 0..2 introduced in row major order and each element equal to an odd number of horizontal and vertical neighbors.
-
A198478: a(n) = 9^n * n^9.
-
A198479: a(n) = 10^n * n^10.
-
A198480: a(n) = 2*7^n - 1.
-
A198517: Period 5: repeat [1,0,1,0,0].
-
A198586: a(n) = (4^A001651(n+1) - 1)/3: numbers (4^k-1)/3 for k > 1, not multiples of 3.
-
A198628: Alternating sums of powers for 1,2,3,4 and 5.
-
A198635: Total number of round trips, each of length 2*n on the graph P_5 (o-o-o-o-o).
-
A198643: a(n) = 5*3^n-1.
-
A198644: a(n) = 8*3^n - 1.
-
A198645: a(n) = 10*3^n - 1.
-
A198646: a(n) = 11*3^n-1.
-
A198647: 3*7^n-1.
-
A198686: 4*7^n-1.
-
A198687: 5*7^n-1.
-
A198688: 6*7^n-1.
-
A198689: 8*7^n-1.
-
A198690: 9*7^n-1.
-
A198691: 10*7^n-1.
-
A198692: a(n) = 11*7^n-1.
-
A198693: a(n) = 3*4^n-1.
-
A198694: a(n) = 7*4^n-1.
-
A198695: a(n) = 11*4^n - 1.
-
A198698: a(n) = 3*10^n - 1.
-
A198699: a(n) = 7*10^n - 1.
-
A198700: a(n) = 11*10^n - 1.
-
A198762: a(n) = 3*5^n - 1 = 2*A057651(n).
-
A198763: a(n) = 4*5^n-1.
-
A198764: 6*5^n-1.
-
A198765: 7*5^n-1.
-
A198766: a(n) = (7*5^n - 1)/2.
-
A198767: 8*5^n-1.
-
A198768: a(n) = 9*5^n-1.
-
A198769: a(n) = (9*5^n-1)/4.
-
A198770: 11*5^n-1.
-
A198771: (11*5^n-1)/2.
-
A198794: a(n) = 5*6^n - 1.
-
A198795: 7*6^n-1.
-
A198796: 3*6^n-1.
-
A198797: 4*6^n-1.
-
A198833: The number of inequivalent ways to color the vertices of a regular octahedron using at most n colors.
-
A198834: Number of sequences of n coin flips that win on the last flip, if the sequence of flips ends with (0,1,1) or (1,1,1).
-
A198845: a(n) = 8*6^n - 1.
-
A198846: a(n) = 9*6^n - 1.
-
A198847: a(n) = 10*6^n - 1.
-
A198848: a(n) = 11*6^n - 1.
-
A198849: a(n) = (11*6^n - 1)/5.
-
A198850: a(n) = 2*8^n - 1.
-
A198851: a(n) = 3*8^n-1.
-
A198852: a(n) = 4*8^n - 1.
-
A198853: a(n) = 5*8^n - 1.
-
A198854: 6*8^n-1.
-
A198855: a(n) = 7*8^n - 1.
-
A198856: a(n) = 9*8^n - 1.
-
A198857: a(n) = 10*8^n - 1.
-
A198858: a(n) = 11*8^n-1.
-
A198859: 2*9^n-1.
-
A198864: a(0) = 1; a(n) = n + product_{i=0..n-1} a(i), n >= 1.
-
A198894: a(n) = A198893(n)/n!.
-
A198915: a(n) = 1 - 2^k + 4^k where k = 3^n.
-
A198959: a(1) = 2, a(n+1) = a(n)^2 - n.
-
A198960: a(n) = 3*9^n-1.
-
A198961: 4*9^n-1.
-
A198962: 5*9^n-1.
-
A198963: a(n) = 6*9^n-1.
-
A198964: a(n) = (7*9^n - 1)/2.
-
A198965: a(n) = 7*9^n - 1.
-
A198966: a(n) = 8*9^n-1.
-
A198967: 10*9^n-1.
-
A198968: 11*9^n-1.
-
A198969: (11*9^n-1)/2.
-
A198970: a(n) = 4*10^n - 1.
-
A198971: a(n) = 5*10^n - 1.
-
A198972: a(n) = (7*10^n - 1)/3.
-
A198973: a(n) = 8*10^n - 1.
-
A198974: 2*11^n-1.