Summary of block A087
Sequences in block A087
Section titled “Sequences in block A087”-
A087009: Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists.
-
A087046: Algebraic order of r_n, the value of r in the logistic map that corresponding to the onset of the period 2^n-cycle.
-
A087057: Smallest number whose square is larger than 2*n^2.
-
A087069: a(n) = Sum_{k >= 0} floor(n/(4^k)).
-
A087076: Sums of the squares of the elements in the subsets of the integers 1 to n.
-
A087099: Partial sums of A063914.
-
A087101: Number of symmetric quartic graphs on n nodes.
-
A087113: Essentially a duplicate of A005843.
-
A087120: Smallest numbers having in binary representation exactly n maximal groups of consecutive zeros.
-
A087123: a(n) = Fibonacci(n+1) - (-1)^n*Fibonacci(n).
-
A087124: a(n) = Fibonacci(n) + Fibonacci(2n+1).
-
A087125: Indices k of hex numbers H(k) that are also triangular.
-
A087130: a(n) = 5*a(n-1)+a(n-2) for n>1, a(0)=2, a(1)=5.
-
A087131: a(n) = 2^n*Lucas(n), where Lucas = A000032.
-
A087156: Nonnegative numbers excluding 1.
-
A087161: Records in A087159, i.e., A087159(a(n)) = n, and satisfies the recurrence a(n+3) = 5*a(n+2) - 6* a(n+1) + 2*a(n) with a(1) = 1, a(2) = 2, and a(3) = 4.
-
A087168: Expansion of (1 + 2*x)/(1 + 3*x + 4*x^2).
-
A087169: Expansion of (1 + 3*x)/(1 + 5*x + 9*x^2).
-
A087170: Expansion of (1 + 4*x)/(1 + 7*x + 16*x^2).
-
A087171: Expansion of (1 + 5*x)/(1 + 9*x + 25*x^2).
-
A087176: a(n) - 1 is the maximal number of integers for which the absolute value of a reducible polynomial with integral coefficients of degree n is a prime.
-
A087192: a(n) = ceiling(a(n-1)*4/3), with a(1) = 1.
-
A087204: Period 6: repeat [2, 1, -1, -2, -1, 1].
-
A087205: a(n) = -2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.
-
A087206: a(n) = 2*a(n-1) + 4*a(n-2); with a(0)=1, a(1)=4.
-
A087208: Expansion of e.g.f. exp(x)/(1-x^2).
-
A087211: a(n) = floor((1+2^n+3^n)/3).
-
A087213: Expansion of (1+x-4*x^2) / ((1+x)*(1-4*x^2)).
-
A087215: Lucas(6*n): a(n) = 18*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 18.
-
A087265: Lucas numbers L(8*n).
-
A087278: Nonnegative integers whose distance to the nearest square is not greater than 1.
-
A087279: Nonnegative numbers whose distance to the nearest positive square equals exactly 1.
-
A087280: Solutions n of max(m+d(m))=n+2 for m<n; d(m) is the number of divisors of m.
-
A087281: a(n) = Lucas(7*n).
-
A087287: a(n) = Lucas(9*n).
-
A087289: a(n) = 2^(2*n+1) + 1.
-
A087290: Number of pairs of polynomials (f,g) in GF(3)[x] satisfying deg(f) <= n, deg(g) <= n and gcd(f,g) = 1.
-
A087291: Number of pairs of polynomials (f,g) in GF(2)[x] satisfying 1 <= deg(f) <= n, 1 <= deg(g) <= n and gcd(f,g) = 1.
-
A087292: Number of pairs of polynomials (f,g) in GF(3)[x] satisfying 1 <= deg(f) < =n, 1 <= deg(g) <= n and gcd(f,g) = 1.
-
A087299: Ratio of volume of n-dimensional ball to circumscribing n-cube is Pi^floor(n/2) divided by a(n).
-
A087323: a(n) = (n+1) * 2^n - 1.
-
A087327: Independence numbers for KT_2 knight on triangular board.
-
A087348: a(n) = 10*n^2 - 6*n + 1.
-
A087399: Duplicate of A085692.
-
A087404: a(n) = 4*a(n-1) + 5*a(n-2) for n > 1, with a(0) = 2 and a(1) = 4.
-
A087420: a(n) is the sum of the squares of the sizes of the conjugacy classes in the dihedral group D_2n.
-
A087426: a(n) = S(n,4) where S(n,m) = sum(k=0,n,binomial(n,k)*Fibonacci(m*k)).
-
A087431: a(n) = 0^n/2 + 2^n*(n^2+n+2)/4.
-
A087432: Expansion of 1+x*(1-x-4*x^2)/((1+x)*(1-2*x)*(1-3*x)).
-
A087433: Expansion of g.f.: (1-2*x)*(1-4*x+x^2)/((1-x)*(1-3*x)*(1-4*x)).
-
A087438: a(n) = 3*2^(2*(n-1)) + 2^(n-2)*(n+1).
-
A087439: Expansion of (1-4x)/((1-x)(1-3x)(1-5x)).
-
A087440: Expansion of (1-2x-3x^2)/((1-2x)(1-4x)).
-
A087444: Numbers that are congruent to {1, 4} mod 9.
-
A087445: Numbers that are congruent to 1 or 5 mod 12.
-
A087446: Numbers that are congruent to {1, 6} mod 15.
-
A087447: a(0) = a(1) = 1; for n > 1, a(n) = (n+2)*2^(n-2).
-
A087448: 3^(n-1)(n+3)/2-(n-1)/2.
-
A087449: a(n) = n * 4^(n-1) + (2*4^n + 1) / 3.
-
A087451: G.f.: (2-x)/((1+2x)(1-3x)); e.g.f.: exp(3x)+exp(-2x); a(n)=3^n+(-2)^n.
-
A087452: G.f.: (2-x)/((1+3x)(1-4x)); e.g.f.: exp(4x) + exp(-3x); a(n) = 4^n + (-3)^n.
-
A087455: Expansion of (1 - x)/(1 - 2*x + 3*x^2) in powers of x.
-
A087463: Generalized multiplicative Jacobsthal sequence.
-
A087464: Generalized multiplicative Jacobsthal sequence.
-
A087475: a(n) = n^2 + 4.
-
A087483: Row 0 of the order array of 3/2, i.e., row 0 of the transposable dispersion in A087465.
-
A087503: a(n) = 3*(a(n-2) + 1), with a(0) = 1, a(1) = 3.
-
A087507: #{0<=k<=n: k*n is divisible by 3}.
-
A087508: Number of k such that mod(k*n,3) = 1 for 0 <= k <= n.
-
A087509: Number of k such that (k*n) == 2 (mod 3) for 0 <= k <= n.
-
A087602: Primes occurring as larger side of Heronian triangle (sides are consecutive integers, area and inradius are integers).
-
A087635: a(n) = S(n,3) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).
-
A087645: Third column of A071223.
-
A087719: Least number m such that the number of numbers k <= m with k > spf(k)^n exceeds the number of numbers with k <= spf(k)^n.
-
A087725: Maximal number of moves required for the n X n generalization of the sliding block 15-puzzle (or fifteen-puzzle).
-
A087734: a(n) = f(f(n)), where f() = A035327().
-
A087752: Powers of 49.
-
A087775: a[1] = 1, a[2] = 2, a[3] = 2; a[n] = 3*a[abs[a[n-2]]] - 3*a[n-abs[a[n-2]]] + a[n-3].
-
A087799: a(n) = 10*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 10.
-
A087811: Numbers k such that ceiling(sqrt(k)) divides k.
-
A087839: a(n) = a(a(a(a(a(n-2))))) + a(n - a(n-2)).
-
A087847: a(n) = a(|n - a(n-1)|) + a(a(a(|n - a(n-4)|))).
-
A087887: a(n) = 18n^3 + 6n^2.
-
A087908: Largest integer not expressible as a nonnegative linear combination of n and n^2 + 1.
-
A087940: a(n) = Sum_{k=0..n} binomial(n+(-1)^k, k).
-
A087944: Expansion of (1-4*x+3*x^2)/((1-2*x)*(1-4*x+x^2)).
-
A087945: Expansion of (1-2x-x^2)/((1-2x)(1-4x+x^2)).
-
A087946: Expansion of (1-3x+x^2)/((1-2x)(1-4x+x^2)).
-
A087953: a(n) = floor((Fibonacci(2*n+1)+1)/2).
-
A087960: a(n) = (-1)^binomial(n+1,2).
-
A087982: Maximal permanent of a nonsingular n X n (+1,-1)-matrix.