Summary of block A108
Sequences in block A108
Section titled “Sequences in block A108”-
A108014: Expansion of (x^2-2*x)/(x^4-x^2+2*x-1).
-
A108019: a(n) = (8^n - 1)*4/7.
-
A108020: a(n) is the number whose binary representation is the concatenation of n strings of the four digits “1100”.
-
A108021: Numbers n whose binary representation is the first Fibonacci(n) binary digits of the pattern 1010101010101010…
-
A108047: Concatenation of the previous pair of numbers, with the first two terms both 1.
-
A108051: a(n+1) = 4*(a(n)+a(n-1)) for n>1, a(1)=1, a(2)=6.
-
A108078: Determinant of a Hankel matrix with factorial elements.
-
A108099: a(n) = 8*n^2 + 8*n + 4.
-
A108100: a(n) = (2*n-1)^2 + (2*n+1)^2.
-
A108104: Sequence A000930 with terms repeated.
-
A108105: 2^floor(n/5).
-
A108118: Integers not divisible by 3 or 4.
-
A108120: Floor[n*1/Sin[1]], or Beatty sequence for 1/sin(1).
-
A108165: a(n) = a(n-1) + A108173(n+1) - A108173(n).
-
A108171: Tribonacci version of A076662 using beta positive real Pisot root of x^3 - x^2 - x - 1.
-
A108173: Let beta = A058265. Sequence gives a(n) = 1 + ceiling((n-1)*beta^2).
-
A108195: a(n) = n^2 + 5*n - 1.
-
A108196: Expansion of (x-1)*(x+1) / (8*x^2 + 1 - 3*x + x^4 - 3*x^3).
-
A108211: a(n) = 16*n^2 + 1.
-
A108213: a(0)=44; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).
-
A108214: Denominator of the O(x^2) term in the Maclaurin series of the square of the Jacobi polynomial P^{a,b}_n(z) about z=1-x for real positive x.
-
A108225: a(0) = 0, a(1) = 2; for n >= 2, a(n) = (a(n-1) + a(n-2))*(a(n-1) - a(n-2) + 1)/2.
-
A108261: 2nd order recursive series having the property that the product of any two adjacent terms is a triangular number, T(b) = b(b+1)/2 where b equals term a(n) of related series A108262.
-
A108262: Second order recursive series having the property that the product of any two adjacent terms equals 4 times a triangular number. That is a(n)*a(n+1)= 4*T(c) = 2c(c+1), where c = the term a(n+1) of related series A108261.
-
A108264: Consider primes p and q such that p = 2^k + 9 and q = 2^(k+1) + 9 for some k; sequence gives values of p.
-
A108265: Consider primes p and q such that p = 2^k + 9 and q = 2^(k+1) + 9 for some k; sequence gives values of q.
-
A108281: Numbers that are both triangular and pentagonal of the second kind.
-
A108300: a(n+2) = 3*a(n+1) + a(n), with a(0) = 1, a(1) = 5.
-
A108306: Expansion of (3*x+1)/(1-3*x-3*x^2).
-
A108354: Expansion of 1/((1-x)^2(1+x^2)^2) in powers of x.
-
A108355: Expansion of (1+2x^2)/((1-x)^2(1+x^2)^2).
-
A108356: Count, repeating multiples of 3 four times, all other numbers twice.
-
A108357: Expansion of (1+x^2+x^4)/(1-x^8).
-
A108362: Pair reversal of Fibonacci numbers.
-
A108397: Sums of rows of the triangle in A108396.
-
A108398: a(n) = n*(1 + n^n)/2.
-
A108400: a(n) = Product_{k = 0..n} (2^k * k!).
-
A108404: Expansion of (1-4x)/(1-8x+11x^2).
-
A108411: a(n) = 3^floor(n/2). Powers of 3 repeated.
-
A108474: Expansion of 1/((1-2*x)*(1+4*x^2)).
-
A108475: Expansion of (1-3*x) / (1-5*x-5*x^2+x^3).
-
A108476: Expansion of (1-4*x)/(1-6*x-12*x^2+8*x^3).
-
A108479: Antidiagonal sums of number triangle A086645.
-
A108495: a(n) = (n^7 - n)/6.
-
A108520: Expansion of 1/(1+2*x+2*x^2).
-
A108579: Number of symmetry classes of 3 X 3 magic squares (with distinct positive entries) having magic sum 3n.
-
A108582: n appears n^3 times.
-
A108586: Floor(2*n*Pi/(2*Pi-1)).
-
A108598: a(n) = floor(n*((5+sqrt(5))/4)).
-
A108611: Excess of Beatty-function of 1/sin(1) over n.
-
A108612: Beatty-2 (or nested Beatty) sequence for 1/sin(1).
-
A108613: Excess of Beatty-2 function of 1/sin(1) over n^2.
-
A108648: a(n) = (n+1)^2*(n+2)^3*(n+3)/24.
-
A108650: a(n) = (n+1)^2*(n+2)*(n+3)*(3*n+4)/24.
-
A108674: a(n) = (n+1)^2 * (n+2)^2 * (2*n+3) / 12.
-
A108678: a(n) = (n+1)^2*(n+2)*(2*n+3)/6.
-
A108732: a(0)=22; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).
-
A108741: Member r=100 of the family of Chebyshev sequences S_r(n) defined in A092184.
-
A108752: Numbers k such that 12 divides k*(k+1).
-
A108765: Expansion of g.f. (1 - x + x^2)/((1-3*x)*(x-1)^2).
-
A108766: a(n) = A007290(n+2) - 1 = 2*C(n+2,3) - 1.
-
A108784: Difference between A107757 and A107755.
-
A108812: 11^n mod 50.
-
A108851: a(n) = 4*a(n-1) + 3*a(n-2), a(0) = 1, a(1) = 2.
-
A108852: Number of Fibonacci numbers <= n.
-
A108869: E.g.f. : exp(6x)/(1-x).
-
A108872: Sums of ordinal references for a triangular table read by columns, top to bottom.
-
A108898: a(n+3) = 3*a(n+2) - 2*a(n), a(0) = -1, a(1) = 1, a(2) = 3.
-
A108924: J(n)^2+J(n+1)^2, with J(n) the Jacobsthal number A001045(n).
-
A108928: a(n) = 8*n^2 - 3.
-
A108929: Expansion of (1-x^4-2*x^3)/((x-1)*(x^2+x+1)*(x^2+4*x-1)).
-
A108942: Degrees of irreducible representations of SL(2,7).
-
A108946: a(2n) = A001570(n), a(2n+1) = -A007654(n+1).
-
A108958: Number of unordered pairs of distinct length-n binary words having the same number of 1’s.
-
A108981: a(n) = 3a(n-1) + 4a(n-2), a(0) = 1, a(1) = 5.
-
A108982: Inverse binomial of A003949.
-
A108983: Inverse binomial transform of A003950.
-
A108984: Inverse binomial transform of A003951.
-
A108985: Expansion of (x+1)*(x^3-x^2-x-1)/((1-x)*(x^2+2*x-1)*(x^2+x+1)).