Summary of block A109
Sequences in block A109
Section titled “Sequences in block A109”-
A109002: Maximal difference between two n-digit numbers.
-
A109007: a(n) = gcd(n,3).
-
A109008: a(n) = gcd(n,4).
-
A109009: a(n) = gcd(n,5).
-
A109014: a(n) = gcd(n,11).
-
A109020: (2*7^n - 3*3^n + 1)/6.
-
A109021: (2*7^n - 6*3^n + 4)/6.
-
A109043: a(n) = lcm(n,2).
-
A109044: a(n) = lcm(n,3).
-
A109045: a(n) = lcm(n,4).
-
A109046: a(n) = lcm(n, 5).
-
A109052: a(n) = lcm(n,11).
-
A109065: Numerator of the fraction due in month n of the total interest for a one-year installment loan based on the Rule of 78s (each denominator is 78).
-
A109094: Length of the longest path (repeated edges not allowed) between two arbitrary, distinct nodes in K_n, the complete graph on n vertices.
-
A109106: a(n) = (1/sqrt(5))*((sqrt(5) + 1)*((15 + 5*sqrt(5))/2)^(n-1) + (sqrt(5) - 1)*((15 - 5*sqrt(5))/2)^(n-1)).
-
A109107: a(n) = (1/sqrt(26))((5+sqrt(26))^(n+1)-(5-sqrt(26))^(n+1)).
-
A109108: a(n) = 10a(n-1) + a(n-2), a(0)=1, a(1)=9.
-
A109109: a(0)=1, a(1)=4, a(n) = 10a(n-1) + a(n-2).
-
A109112: a(n) = 6*a(n-1) - 3*a(n-2), a(0)=2, a(1)=13.
-
A109113: a(n) = 6*a(n-1) + 3*a(n-2), a(0)=2, a(1)=14.
-
A109114: a(n) = 5*a(n-1) - 3*a(n-2), a(0)=1, a(1)=6.
-
A109115: a(n) = 4*a(n-1) + 3*a(n-2), a(0)=1, a(1)=6.
-
A109118: a(n) = 2*(n^2 + 3*n + 1)^3.
-
A109119: a(n) = 2(5n^2 + 5n + 1)^3.
-
A109132: Numbers n such that n! + 1 is a Chen prime. n! + 1 is then called a factorial Chen prime.
-
A109164: a(n) = 4*a(n-1) - 4*a(n-2) + a(n-3), n >= 3; a(0)=1, a(1)=6, a(2)=20.
-
A109172: Recursive form of A109845 without a(2)=3.
-
A109173: Recursive form of A109845 but with a(1)=1.
-
A109231: a(n) = floor(n*cosh(1)).
-
A109232: a(n) = floor(n*(e^2+1)/(e-1)^2).
-
A109234: a(n) = floor(n*sinh(1)).
-
A109235: a(n) = floor(n*(e^2-1)/(e^2-2*e-1)).
-
A109237: a(n) = floor(n*coth(1)).
-
A109238: a(n) = floor(n*(e^2+1)/2).
-
A109241: Expansion of 1/((1-10*x)*(1-100*x)).
-
A109265: Row sums of Riordan array (1-x-x^2,x(1-x)).
-
A109300: a(n) = number of positive integers whose rote height in gammas is n.
-
A109340: Expansion of x^2*(1+x+4*x^2)/((1+x+x^2)*(1-x)^3).
-
A109345: a(n) = 5^((n^2 - n)/2).
-
A109354: a(n) = 6^((n^2 - n)/2).
-
A109362: Period 6: repeat [0, 0, 1, 2, 0, 3].
-
A109363: a(n) = 4*2^n - 3*n - 5.
-
A109384: a(n) = 2^(2^(n+2)+1).
-
A109391: a(n) = (n^(n+1))*(n + 1)/2 = A000217(n)*A000312(n).
-
A109398: a(n) = (1/n!)*Sum_{k=0..n} (n+k)!.
-
A109437: a(-1) = a(0) = 0, a(1) = 1; a(n) = 5a(n-1) - 5a(n-2) + a(n-3) + 2*(-1)^(n+1), alternatively a(n) = 3a(n-1) + 3a(n-2) - a(n-3).
-
A109438: a(n) = 5a(n-1) - 5a(n-2) + a(n-3) + 2*(-1)^(n+1), alternatively a(n) = 3a(n-1) + 3a(n-2) - a(n-3).
-
A109451: a(1)=1; a(n) = smallest positive integer not already present such that a(n-1) and a(n) have a different number of 1’s in their binary expansions.
-
A109493: a(n) = 7^((n^2 - n)/2).
-
A109498: Number of closed walks of length 2n on the Heawood graph from a given node.
-
A109499: Number of closed walks of length n on the complete graph on 5 nodes from a given node.
-
A109500: Number of closed walks of length n on the complete graph on 6 nodes from a given node.
-
A109501: Number of closed walks of length n on the complete graph on 7 nodes from a given node.
-
A109522: a(n) = the (1,2)-entry in the matrix P^n + F^n, where the 2 X 2 matrices P and F are defined by P=[0,1;1,0] and F=[0,1;1,1].
-
A109546: (4^(n+1)-(-1)^n 9 )/5.
-
A109613: Odd numbers repeated.
-
A109620: a(n) = (1/3)*n^3 - n^2 - (1/3)*n - 1.
-
A109622: Number of different isotemporal classes of diasters with n peripheral edges.
-
A109630: The winning position when playing the “eeny meeny miny moe” game with n players and eliminating every 8th player.
-
A109632: In the game of bridge, a(n) is the penalty for going down n tricks in a vulnerable, doubled contract.
-
A109678: Sequence and first differences include all square numbers exactly once.
-
A109718: Periodic sequence with period {0,1,0,3}, or n^3 mod 4.
-
A109720: Periodic sequence {0,1,1,1,1,1,1} or n^6 mod 7.
-
A109752: Using the lunar product (see A087062 for definition), numbers n such that if n divides a*b, then n must divide either a or b. The multiplicative identity, 9, is excluded by convention.
-
A109753: n^3 mod 8; the periodic sequence {0,1,0,3,0,5,0,7}.
-
A109764: Sum of the first n^2 squares.
-
A109765: Expansion of x/((4*x-1)*(2*x-1)*(x+1)).
-
A109768: a(n) = gcd(3^n-2,2^n-3).
-
A109774: a(n) = (3^(n-1) - 1) * (3^n - 1)/2.
-
A109794: a(2n) = A001906(n+1), a(2n+1) = A002878(n).
-
A109795: a(n)= n*(1+floor(n/10)).
-
A109803: Expansion of (x^2+1)*(x+1)^2 / ((x-1)*(x^2+x+1)*(x^2+2*x-1)).
-
A109808: a(n) = 2*7^(n-1).
-
A109851: a(1) = 1, a(2) = 2; for n > 2, sum of absolute differences of all combinations of pairs of previous terms.
-
A109900: The (n,r)-th term of the following triangle is T(n)-T(r) for r = 0 to n. The n-th row contains n+1 terms. T(n) = the n-th triangular number = n(n+1)/2. Sequence contains the sum of terms at a 45-degree angle.
-
A109961: Expansion of (1-x)^3/(1-4x+5x^2-4x^3+x^4).
-
A109964: a(n) = floor(sqrt(Sum_{i<n} a(i))), with a(0)=1.
-
A109975: Second differences of A045623, prefixed by an initial 1.