Summary of block A120
Sequences in block A120
Section titled “Sequences in block A120”-
A120054: a(n) = binomial(n+3,4)*4^4.
-
A120071: a(n) = n*(n+20).
-
A120096: a(n) = (A046717(n))^2 (starting with n=1).
-
A120134: a(n) = 4 + floor(Sum_{k=1..n-1} a(k) / 2).
-
A120135: a(n) = 5 + floor((1 + Sum_{j=1..n-1} a(j)) / 2).
-
A120136: a(n) = 7 + floor(Sum_{j=1..n-1} a(j) / 2).
-
A120137: a(n) = 8 + floor( (1 + Sum_{j=1..n-1} a(j)) / 2).
-
A120139: a(n) = 11 + floor( (1 + Sum_{j=1..n-1} a(j)) / 2).
-
A120142: a(n) = 16 + floor(Sum_{j=1..n-1} a(j)/2).
-
A120149: a(n) = 2 + floor((1 + Sum_{j=1..n-1} a(j))/3).
-
A120150: a(n) = 3 + floor((2 + Sum_{j=1..n-1} a(j))/3).
-
A120160: a(n) = ceiling(Sum_{i=1..n-1} a(i)/4) for n >= 2 starting with a(1) = 1.
-
A120161: a(n) = 2 + floor((1 + Sum_{j=1..n-1} a(j))/4).
-
A120162: a(n) = 3 + floor((2 + Sum_{j=1..n-1} a(j))/4).
-
A120166: a(n) = 8 + floor((2 + Sum_{j=1..n-1} a(j))/4).
-
A120170: a(n) = ceiling( Sum_{i=1..n-1} a(i)/5 ), a(1)=1.
-
A120186: a(n) = ceiling( Sum_{i=1..n-1} a(i)/7 ), a(1) = 1.
-
A120195: a(1)=2; a(n) = floor((17 + Sum_{j=1..n-1} a(j))/8).
-
A120276: Prime numbers p such that p divides the sum of squares of Catalan numbers A094639(p).
-
A120289: Primes p such that p divides the numerator of Sum_{k=1..n-1} 1/prime(k)^p, where p = prime(n).
-
A120304: Catalan numbers minus 2.
-
A120307: Inverse determinant of n X n matrix M[i,j] = i*j/(i+j-1).
-
A120323: Periodic sequence 0, 3, 1, 0, 1, 3.
-
A120324: Periodic sequence 0, 1, 0, 4, 0, 1.
-
A120325: Period 6: repeat [0, 0, 1, 0, 1, 0].
-
A120353: Sum of 5 consecutive powers of 3, starting with a power of 9.
-
A120354: a(n) = 11*3^n.
-
A120370: a(1) = 2. a(n) = a(n-1) + (maximum number of distinct primes dividing any earlier terms).
-
A120377: Primes of the form 2*11^k-1.
-
A120387: c(n) mod b(n) where c(n) = (n-1)! and b(n) = Sum_{i=1..n} i.
-
A120413: Largest even number strictly less than n^2.
-
A120436: Complete list of numbers that can be represented both as a product of 2 consecutive integers and as a product of 3 consecutive integers.
-
A120445: Number of different convex inscribed polygons with n pair of sides of lengths d1, d2, …, dn all distinct. Or number of bracelets with n pairs of beads, each pair of one among n colors.
-
A120462: Expansion of -2*x*(-3-2*x+4*x^2) / ((x-1)*(2*x+1)*(2*x-1)*(1+x)).
-
A120470: a(n) = 2*4^n + (-1)^n*2^(n-1).
-
A120471: a(n) = 6 * A015518(n).
-
A120514: a(n) = min{j : A120503(j) = n}.
-
A120518: a(n) = min{j : A120507(j) = n}.
-
A120540: Number of C-rotamers with n carbon atoms.
-
A120563: Prime numbers of the form Product_{k=1..m} prime(k)^k + 1.
-
A120571: 2n^4+6n^2+4 = 2(n^2+1)(n^2+2).
-
A120573: a(n) = n^5 + 3*n^3 + 2*n = n*(n^2 + 1)*(n^2 + 2).
-
A120580: Hankel transform of Sum_{k=0..n} C(2k,k).
-
A120582: Hankel transform of Sum_{k=0..floor(n/2)} binomial(2*k, k).
-
A120587: Number of inequivalent (under the group of permutations and “inversion of variables”) nondegenerate monotone Boolean functions of n variables.
-
A120588: G.f. is 1 + x*c(x), where c(x) is the g.f. of the Catalan numbers (A000108).
-
A120612: For n>1, a(n) = 2*a(n-1) + 15*a(n-2); a(0)=1, a(1)=1.
-
A120615: a(n) = Sum_{k=0..n} floor(phi*floor(k/phi)) where phi = (1+sqrt(5))/2.
-
A120617: Hankel transform of g.f. 1/sqrt(1+4x^2).
-
A120634: Decimal equivalent of A066335.
-
A120656: a(n) = (-4 + (-2)^n + 2*3^(n+1))/3 - [n=0].
-
A120689: a(n) = 10*a(n-1) - 16*a(n-2), with a(0) = 0 and a(1) = 3.
-
A120694: Sequence demonstrating the Pythagorean theorem.
-
A120718: Expansion of 3*x/(1 - 2*x^2 - 2*x + x^3).
-
A120738: a(n) = 4*n - A000120(n).
-
A120740: Numbers n such that n = Sum_digits[k*abs(n-k)] for some k>=0.
-
A120741: a(n) = (7^n - 1)/2.
-
A120752: Numbers k such that {rk} <= c, where r = (1/2)^(1/2), c = 1/2 and { } denotes fractional part.
-
A120767: a(n) = 2^(n^2) + 3^n.
-
A120773: a(n) = 2^(n^2) - 3^n.
-
A120775: a(n) = 3*a(n-1) + 5*a(n-2) + a(n-3).
-
A120798: 3^(n^2)+2^n.
-
A120799: 3^(n^2)-2^n.
-
A120800: a(n) = 3^(n^2) + 2^(n^2).
-
A120801: a(n) = 3^(n^2) - 2^(n^2).
-
A120802: 5^(n^2)+3^n.
-
A120822: a(n) consecutive digits ascending beginning with the digit 4 give a prime.
-
A120827: a(n) consecutive digits ascending beginning with the digit 9 give a prime.
-
A120830: 5^(n^2)-3^n.
-
A120838: a(n) = 5^(n^2)+3^(n^2).
-
A120845: a(n) = 2^n + 3^n + 5*n.
-
A120846: a(n) = 3^n + 2^n + n.
-
A120848: a(n) = 2^n + 3^n - n.
-
A120849: a(n) = 5*n + 3^n - 2^n.
-
A120892: a(n)=3*a(n-1)+3*a(n-2)-a(n-3);a(0)=1,a(1)=0,a(2)=3. a(n)=4*{a(n-1)+(-1)^n}-a(n-2);a(0)=1,a(1)=0.
-
A120893: a(n) = 3*a(n-1) + 3*a(n-2) - a(n-3); a(0)=1, a(1)=1, a(2)=5.
-
A120908: Sum of the lengths of the drops in all ternary words of length n on {0,1,2}. The drops of a ternary word on {0,1,2} are the subwords 10,20 and 21, their lengths being the differences 1, 2 and 1, respectively.
-
A120926: Number of isolated 0’s in all ternary words of length n on {0,1,2}.
-
A120929: Partial sums of n^(n^2), A002489.
-
A120940: Alternating sum of the Fibonacci numbers multiplied by their (combinatorial) indices.
-
A120948: 8n+3^n+5^n.
-
A120949: 2n+3^n+5^n.
-
A120950: 3^n+5^n-2n.
-
A120969: a(n) = 8n+5^n-3^n.
-
A120978: 2n+5^n-3^n.
-
A120990: 5^n-3^n-2n.