Summary of block A119
Sequences in block A119
Section titled “Sequences in block A119”-
A119032: a(n+2) = 18*a(n+1) - a(n) + 8.
-
A119282: Alternating sum of the first n Fibonacci numbers.
-
A119309: a(n) = binomial(2*n,n) * 6^n.
-
A119332: Expansion of (1+x)/(1-2x^4).
-
A119408: Decimal equivalent of the binary string generated by the n X n identity matrix.
-
A119412: a(n) = n*(n+11).
-
A119413: a(n) = 16*n - 12.
-
A119536: a(n) = 3*n^3 + 3*n.
-
A119550: Prime numbers of the form 2^(2^k) + 2^k - 1.
-
A119561: Define F(n) = 2^(2^n)+1 = the n-th Fermat number, M(n) = 2^n-1 = the n-th Mersenne number. Then a(n) = F(n)+M(n)+1=2^(2^n)+1+2^n-1+1 = 2^(2^n)+2^n+1 = F(n)+2^n.
-
A119562: Let F(n) = 2^(2^n) + 1 = the n-th Fermat number, M(n) = 2^n - 1 = the n-th Mersenne number. Then a(n) = F(n) - M(n) + 1 = 2^(2^n) + 1 - (2^n - 1) + 1 = 2^(2^n) - 2^n + 3.
-
A119563: Define F(n) = 2^(2^n)+1 = n-th Fermat number, M(n) = 2^n-1 = the n-th Mersenne number. Then a(n) = F(n)+M(n)-1 = 2^(2^n) + 2^n - 1.
-
A119564: Define F(n) = 2^(2^n)+1 = n-th Fermat number, M(n) = 2^n-1 = the n-th Mersenne number. Then a(n) = F(n)-M(n)-1 = 2^(2^n) - 2^n + 1.
-
A119571: a(n) = 2^(2^n - 1) + 2^(2^(n + 1) - 1) + 1.
-
A119572: a(n) = (2^(2^n) + 1 + 2^(2^(n + 1) - 1) + 1)/2.
-
A119574: a(n) = binomial(2*n,n)*(n+2)^2/(n+1).
-
A119576: (n+n^2+n^3)*(binomial(2*n,n)).
-
A119577: (n+n^2+n^3)*(binomial(2*n,n))/2.
-
A119578: a(n) = (n + n^2)*binomial(2*n,n)/2.
-
A119579: a(n) = (n + n^2)*(binomial(2*n, n)).
-
A119580: a(n) = (n^2+n^3)*binomial(2*n,n).
-
A119581: a(n) = (2*n+n^2)*(binomial(2*n,n))/2.
-
A119582: a(n) = (n^2+n^3)*(binomial(2*n,n))/2.
-
A119587: 2^n + 1 - 2*Fibonacci(n+1).
-
A119598: Numbers that are repunits in four or more bases.
-
A119602: Number of nonisomorphic polytetrahedra with n identical regular tetrahedra connected face-to-face or edge-to-edge (chiral shapes counted twice).
-
A119610: Number of cases in which the first player is killed in a Russian roulette game where 5 players use a gun with n chambers and the number of bullets can be from 1 to n. Players do not rotate the cylinder after the game starts.
-
A119617: Integers of the form c(n)/b(n) where c(n+1)=c(n)+(n+1)^4 with c(0)=1 and b(n+1)=b(n)+(n+1)^2 with b(0)=1.
-
A119622: Numbers m such that no group of order m is a Con-Cos group.
-
A119635: a(n) = n*(1 + n^2)*2^n.
-
A119662: Primes of the form k! + k^2 + 1.
-
A119669: Number of chambers in root systems of type B_n (or C_n).
-
A119683: Maximal number of steps that an n-state Turing machine can make which was started on an initially blank tape before halting on the blank tape again.
-
A119690: n! mod n*(n+1)/2.
-
A119692: a(n) = binomial(2*n,n) * Fibonacci(n).
-
A119693: a(n) = binomial(2*n,n) * Fibonacci(n)/2.
-
A119694: a(n) = Fibonacci(n) * Catalan(n).
-
A119697: a(n) = Fibonacci(n)*n*binomial(2*n,n)/(n+1).
-
A119701: a(n) = n*binomial(2*n, n)*Fibonacci(n).
-
A119702: a(n) = n^2*binomial(2*n, n)*Fibonacci(n).
-
A119703: a(n) = n^3*binomial(2*n, n)*Fibonacci(n).
-
A119719: Continued fraction expansion of the value (mod 1) where ?(x)-x attains its global maximum.
-
A119771: Product of n^2 and n-th tetrahedral number: a(n) = n^3*(n+1)*(n+2)/6.
-
A119837: a(n)=(2n)!/n!-(2n)!/(n-1)!.
-
A119910: Period 6: repeat [1, 3, 2, -1, -3, -2].
-
A119913: Number of directed simple cycles in the complete graph K_n.
-
A119915: Number of ternary words of length n and having exactly one run of 0’s of odd length.
-
A119916: Number of runs of 0’s of odd length in all ternary words of length n.
-
A119972: a(n) = n * A034947(n).
-
A119996: Numerator of Sum_{k=1..n} 1/(Fibonacci(k)*Fibonacci(k+2)).