Summary of block A196
Sequences in block A196
Section titled “Sequences in block A196”-
A196199: Count up from -n to n for n = 0, 1, 2, … .
-
A196258: a(n) = 11^n*n!.
-
A196280: a(n) = binomial(n+9, 9)*8^n.
-
A196288: a(n) = n^8 + n.
-
A196289: a(n) = n^9 - n.
-
A196290: a(n) = n^9 + n.
-
A196291: a(n) = n^10 - n.
-
A196292: a(n) = n^10 + n.
-
A196305: a(n) = 15*2^n - 1.
-
A196410: a(n) = n*2^(n-5).
-
A196411: n! - n^4.
-
A196412: a(n) = n! - n^5.
-
A196413: n! - n^6.
-
A196414: n! - n^7.
-
A196472: a(1)=1; a(n) = floor((3 + sqrt(21))*a(n-1)/2) for n > 1.
-
A196506: a(n) = 1*3*5 + 3*5*7 + 5*7*9 + … (n terms).
-
A196507: a(n) = n*(3*n^2 + 6*n + 1).
-
A196508: a(n) = 2^n*(n^2 - n + 4)-4.
-
A196512: Expansion of g.f. (1-9*x)/(1-28*x).
-
A196514: Partial sums of A100381.
-
A196532: a(n) = (n+1)!*(H(n)+H(n+1)), where H(n) = Sum_{k=1..n} 1/k is the n-th harmonic number.
-
A196592: Maximum number of floors with n elevators and 3 stops.
-
A196594: Maximum number of floors with 4 elevators and s stops.
-
A196655: 33*2^(n+1) + 7.
-
A196657: 63*2^(n+1) + 1.
-
A196661: Expansion of g.f. (1-2*x)/(1-7*x).
-
A196662: Expansion of g.f. (1-3*x)/(1-10*x).
-
A196663: Expansion of g.f. (1-4*x)/(1-13*x).
-
A196664: Expansion of g.f. (1-5*x)/(1-16*x).
-
A196665: Expansion of g.f. (1-6*x)/(1-19*x).
-
A196666: Expansion of g.f. (1 - 7*x)/(1 - 22*x).
-
A196676: Expansion of g.f. (1-8*x)/(1-25*x).
-
A196731: Expansion of g.f. (1-x)/(1-12*x).
-
A196738: n! - n^8.
-
A196739: a(n) = n! - n^10.
-
A196789: Binomial coefficients C(2*n+10,10).
-
A196790: Binomial coefficients C(2*n-9,10).
-
A196791: a(n) = A047848(9, n).
-
A196792: a(n) = A047848(10, n).
-
A196793: a(n) = A047848(n, n).
-
A196836: a(n) = (1^n + 2^n +3^n + 4^n)/2.
-
A196870: a(n+1) = A001610(n)*a(n).