Summary of block A102
Sequences in block A102
Section titled “Sequences in block A102”-
A102039: a(n) = a(n-1) + last digit of a(n-1), starting at 1.
-
A102040: a(n) = a(n-1) + last digit of a(n-1), starting at 3.
-
A102081: Duplicate of A068397.
-
A102083: a(n) = 8*n^2 + 4*n + 1.
-
A102091: Number of perfect matchings in the C_{2n} X P_3 graph (C_{2n} is the cycle graph on 2n vertices and P_3 is the path graph on 3 vertices).
-
A102094: a(n) = (2*n-1)*(2*n+1)^2.
-
A102126: Minimum number of pieces needed to dissect a square into n smaller squares (not necessarily of the same size).
-
A102129: Expansion of (1 - x)*(1 + 2*x) / ((1 + x)*(1 - 4*x - x^2)).
-
A102147: Second Eulerian transform of 1, 2, 3, 4, 5, … (A000027).
-
A102206: a(0) = 3, a(1) = 8, a(n+2) = 4*a(n+1) - a(n) - 2.
-
A102207: a(n) = 5a(n-1) - 5a(n-2) + a(n-3) with a(0) = 4, a(1) = 17, a(2) = 65.
-
A102214: Expansion of (1 + 4*x + 4*x^2)/((1+x)*(1-x)^3).
-
A102239: a(n) = (Sum_{i=0..n} 5^i) + 1 - (Sum_{i=0..n} 5^i) mod 2.
-
A102282: Smallest possible example of an MSTD (“More sums than differences”) set.
-
A102283: Period 3: repeat [0, 1, -1].
-
A102285: G.f. (1-x)/(7*x^2-6*x+1).
-
A102301: a(n) = ((3*n + 1)*2^(n+3) + 9 + (-1)^n)/18.
-
A102302: Largest number < n/2 coprime to n.
-
A102303: a(n) = (1/6) * (7^(n+1) - 3*(-1)^n + 2).
-
A102305: a(n) = n^2 + 2*n + 3.
-
A102307: a(n) = Fibonacci(2n+1) * binomial(2n,n).
-
A102312: a(n) = Fibonacci(5*n).
-
A102344: Numbers n such that the Diophantine equation (x+2)^3-x^3=2*n^2 has solutions.
-
A102345: a(n) = 3^n + (-1)^n.
-
A102389: An evil count.
-
A102390: An odious count.
-
A102391: Evil numbers in evil places.
-
A102392: Odious numbers in odious places.
-
A102393: A wicked evil sequence.
-
A102394: A wicked odious sequence.
-
A102438: a(n) = 100*n + 44.
-
A102439: a(n) = 100*n + 4.
-
A102446: a(n) = a(n-1) + 4*a(n-2) for n>1, a(0) = a(1) = 2.
-
A102483: Numbers k such that 2^k contains no zeros in base 3.
-
A102485: a(n) = 5*3^n - 4*2^n.
-
A102486: a(n) = 4*a(n-1) - 5*a(n-2).
-
A102515: a(n) = floor(1 + sqrt(2n + 1)).
-
A102518: a(n) = Sum_{k=0..n} binomial(n, k) * Sum_{j=0..k} binomial(3k, 3j).
-
A102560: Expansion of (1-x^3)/(1-x^4).
-
A102561: a(n) = 2^floor(n/2)*((-1)^floor(n/2) + (-1)^n)/2.
-
A102565: a(n) = A102563(n) - A102564(n).
-
A102572: a(n) = floor(log_4(n)).
-
A102591: a(n) = Sum_{k=0..n} binomial(2n+1, 2k)*3^(n-k).
-
A102592: a(n) = Sum_{k=0..n} binomial(2n+1, 2k)*5^(n-k).
-
A102603: a(n) = 24*n + 21.
-
A102650: a(n) = 4 * floor(28*2^n/15).
-
A102652: a(n) = 4 * floor(24*2^n/15) = 4*A077854(n).
-
A102653: a(n) = 4 * floor(9*2^n/5).
-
A102689: a(n) = 10000*n + 2468.
-
A102690: Number of n-expodigital numbers (i.e., numbers m such that m^n has exactly n decimal digits).
-
A102691: Least n-expodigital number (i.e., numbers m such that m^n has exactly n decimal digits).
-
A102693: a(n) is the number of digraphs (not allowing loops) with vertices 1,2,…,n that have a unique Eulerian tour (up to cyclic shift).
-
A102710: a(1) = 2, a(2) = 3, a(n+2) = a(n)*(a(n)+a(n+1)) - a(n+1).
-
A102714: Expansion of (x+2) / ((x+1)*(x^2-3*x+1)).
-
A102736: Number of permutations of n elements without cycles whose length is a multiple of 3.
-
A102741: a(n) = 3^4 * binomial(n+3, 4).
-
A102772: Numbers n such that binomial(n,3) is in A027568.
-
A102794: Duplicate of A075415.
-
A102807: a(n) is the square of one plus the number consisting of n 3’s.
-
A102846: a(0)=1, a(1)=1, a(n) = a(n-1)*a(n-2) + 2.
-
A102847: a(0)=1, a(n) = a(n-1)*a(n-1) + 2.
-
A102860: Number of ways to change three non-identical letters in the word aabbccdd…, where there are n types of letters.
-
A102865: Base-4 digits are, in order, the first n terms of the sequence (1, 3, 21, 203, 2021, 20203, 202021, 2020203, 20202021, 202020203, … ).
-
A102871: a(n) = a(n-3) - 5*a(n-2) + 5*a(n-1), a(0) = 1, a(1) = 3, a(2) = 10.
-
A102899: a(n) = ceiling(n/3)^2 - floor(n/3)^2.
-
A102900: a(n) = 3*a(n-1) + 4*a(n-2), a(0)=a(1)=1.
-
A102901: a(n) = a(n-1) + 6*a(n-2), a(0)=1, a(1)=0.
-
A102902: a(n) = 9*a(n-1) - 16*a(n-2), with a(0) = 1, a(1) = 9.
-
A102909: a(n) = Sum_{j=0..8} n^j.
-
A102967: Numbers n such that 3*10^n + 2*R_n + 5 is prime, where R_n = 11…1 is the repunit (A002275) of length n.
-
A102997: Numbers n such that 4*10^n + 8*R_n - 7 is prime, where R_n = 11…1 is the repunit (A002275) of length n.