Summary of block A199
Sequences in block A199
Section titled “Sequences in block A199”-
A199018: a(n) = (3*11^n - 1)/2.
-
A199019: a(n) = 3*11^n - 1.
-
A199020: a(n) = 4*11^n-1.
-
A199021: a(n) = (5*11^n - 1)/2.
-
A199022: a(n) = 5*11^n - 1.
-
A199023: a(n) = (6*11^n - 1)/5.
-
A199024: a(n) = 6*11^n - 1.
-
A199025: a(n) = (7*11^n-1)/2.
-
A199026: a(n) = 7*11^n-1.
-
A199027: a(n) = 8*11^n-1.
-
A199028: a(n) = (9*11^n - 1)/2.
-
A199029: a(n) = 9*11^n - 1.
-
A199030: a(n) = 10*11^n-1.
-
A199031: a(n) = 2*12^n-1.
-
A199032: a(n) = 3*12^n-1.
-
A199106: a(n) = 4*12^n - 1.
-
A199107: a(n) = 5*12^n - 1.
-
A199108: a(n) = 4*3^n + 1.
-
A199109: a(n) = (7*3^n + 1)/2.
-
A199110: a(n) = 7*3^n + 1.
-
A199111: a(n) = 8*3^n + 1.
-
A199112: a(n) = 10*3^n+1.
-
A199113: a(n) = (11*3^n+1)/2.
-
A199114: a(n) = 11*3^n+1.
-
A199115: a(n) = 5*4^n+1.
-
A199116: a(n) = 6*4^n + 1.
-
A199203: Decimal expansion of f(0) where f is the functional square root (half-iterate) of exponent, f(f(x))=exp(x).
-
A199207: a(n) = 7*4^n+1.
-
A199208: a(n) = 9*4^n+1.
-
A199209: a(n) = 10*4^n+1.
-
A199210: a(n) = (11*4^n + 1)/3.
-
A199211: a(n) = 11*4^n + 1.
-
A199212: a(n) = 2*5^n+1.
-
A199213: a(n) = (3*5^n+1)/2.
-
A199214: a(n) = 3*5^n+1.
-
A199215: a(n) = 4*5^n + 1.
-
A199216: 6*5^n+1.
-
A199299: a(n) = (2*n + 1)*6^n.
-
A199300: a(n) = (2*n + 1)*7^n.
-
A199301: a(n) = (2n+1)*8^n.
-
A199308: (7*5^n+1)/4.
-
A199309: (7*5^n+1)/2.
-
A199310: 7*5^n+1.
-
A199311: 8*5^n+1.
-
A199312: (9*5^n+1)/2.
-
A199313: 9*5^n+1.
-
A199314: a(n) = (11*5^n + 1)/4.
-
A199315: (11*5^n+1)/2.
-
A199316: 11*5^n+1.
-
A199317: a(n) = 2*6^n + 1.
-
A199318: 3*6^n+1.
-
A199319: 4*6^n+1.
-
A199320: 5*6^n+1.
-
A199321: 7*6^n+1.
-
A199394: The number of ways to color the vertices of all (11) simple unlabeled graphs on 4 nodes using at most n colors.
-
A199398: XOR of the first n odd numbers.
-
A199403: Binary XOR of (2^k - (-1)^k)/3 as k varies from 1 to n.
-
A199404: x-values in the solution to 13*x^2 - 12 = y^2.
-
A199411: 8*6^n+1.
-
A199412: a(n) = (9*6^n+1)/5.
-
A199413: 9*6^n+1.
-
A199414: 10*6^n+1.
-
A199415: 11*6^n+1.
-
A199416: 2*7^n+1.
-
A199417: (3*7^n+1)/2.
-
A199418: 3*7^n+1.
-
A199419: 4*7^n+1.
-
A199420: a(n) = (5*7^n+1)/3.
-
A199421: (5*7^n+1)/2.
-
A199422: 5*7^n+1.
-
A199483: 6*7^n+1.
-
A199484: (8*7^n+1)/3.
-
A199485: 8*7^n+1.
-
A199486: (9*7^n+1)/2.
-
A199487: 9*7^n+1.
-
A199488: 10*7^n+1.
-
A199489: a(n) = (11*7^n + 1)/6.
-
A199490: a(n) = (11*7^n + 1)/3.
-
A199491: a(n) = (11*7^n + 1)/2.
-
A199492: a(n) = 11*7^n + 1.
-
A199493: a(n) = 2*8^n + 1.
-
A199494: a(n) = 3*8^n + 1.
-
A199531: Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two consecutive zero elements.
-
A199552: a(n) = 4*8^n + 1.
-
A199553: 5*8^n+1.
-
A199554: 6*8^n+1.
-
A199555: 7*8^n+1.
-
A199556: 9*8^n+1.
-
A199557: 10*8^n+1.
-
A199558: 11*8^n+1.
-
A199559: 2*9^n+1.
-
A199560: a(n) = (3*9^n + 1)/2.
-
A199561: a(n) = 3*9^n + 1.
-
A199562: 4*9^n+1.
-
A199563: 5*9^n+1.
-
A199564: 6*9^n+1.
-
A199565: a(n) = (7*9^n + 1)/4.
-
A199566: a(n) = (7*9^n + 1)/2.
-
A199567: a(n) = 7*9^n + 1.
-
A199572: Number of round trips of length n on the cycle graph C_2 from any of the two vertices.
-
A199573: Number of round trips of length n from any of the four vertices of the cycle graph C_4.
-
A199591: Generalized Fermat numbers: 5^(2^n) + 1, n >= 0.
-
A199592: Generalized Fermat numbers: 11^(2^n) + 1, n >= 0.
-
A199677: 8*9^n+1.
-
A199678: 10*9^n+1.
-
A199679: (11*9^n+1)/4.
-
A199680: a(n) = (11*9^n+1)/2.
-
A199681: 11*9^n+1.
-
A199682: a(n) = 2*10^n + 1.
-
A199683: a(n) = 3*10^n + 1.
-
A199684: a(n) = 4*10^n+1.
-
A199685: a(n) = 5*10^n + 1.
-
A199686: a(n) = 6*10^n + 1.
-
A199687: a(n) = 7*10^n + 1.
-
A199688: a(n) = (8*10^n + 1)/3.
-
A199689: a(n) = 8*10^n + 1.
-
A199690: a(n) = (11*10^n + 1)/3.
-
A199691: a(n) = 11*10^n + 1.
-
A199705: Number of -n..n arrays x(0..2) of 3 elements with zero sum and no two neighbors equal.
-
A199750: 2*11^n+1.
-
A199751: (3*11^n+1)/2.
-
A199752: 3*11^n+1.
-
A199753: 4*11^n+1.
-
A199754: a(n) = (5*11^n+1)/2.
-
A199755: 5*11^n+1.
-
A199756: a(n) = 6*11^n + 1.
-
A199757: a(n) = (7*11^n+1)/2.
-
A199758: 7*11^n+1.
-
A199759: 8*11^n+1.
-
A199760: a(n) = (9*11^n + 1)/10.
-
A199761: (9*11^n+1)/5.
-
A199762: a(n) = (9*11^n+1)/2.
-
A199763: a(n) = 9*11^n + 1.
-
A199764: 10*11^n+1.
-
A199771: Row sums of the triangle in A199332.
-
A199817: Odd numbers producing 10 even numbers in the Collatz iteration.
-
A199833: Number of -n..n arrays of 4 elements with zero sum and no two neighbors summing to zero.
-
A199899: Number of -n..n arrays x(0..3) of 4 elements with zero sum, and adjacent elements not both strictly positive and not both strictly negative.
-
A199910: Number of -n..n arrays x(0..2) of 3 elements with zero sum, and adjacent elements not equal modulo three (with -1 modulo 3 = 2).
-
A199923: a(n) = Sum_{k=0..3^(n-1)} gcd(k,3^(n-1)) for n > 0 and a(0) = 1.
-
A199969: a(n) = the greatest non-divisor h of n (1 < h < n), or 0 if no such h exists.