Summary of block A081
Sequences in block A081
Section titled “Sequences in block A081”-
A081002: a(n) = Fibonacci(4n) + 1, or Fibonacci(2n-1)*Lucas(2n+1).
-
A081003: a(n) = Fibonacci(4n+1) + 1, or Fibonacci(2n+1)*Lucas(2n).
-
A081004: a(n) = Fibonacci(4n+2) + 1, or Fibonacci(2n+2)*Lucas(2n).
-
A081005: a(n) = Fibonacci(4n+3) + 1, or Fibonacci(2n+1)*Lucas(2n+2).
-
A081006: a(n) = Fibonacci(4n) - 1, or Fibonacci(2n+1)*Lucas(2n-1).
-
A081007: a(n) = Fibonacci(4n+1) - 1, or Fibonacci(2n)*Lucas(2n+1).
-
A081008: a(n) = Fibonacci(4n+2) - 1, or Fibonacci(2n)*Lucas(2n+2).
-
A081009: a(n) = Fibonacci(4n+3) - 1, or Fibonacci(2n+2)*Lucas(2n+1).
-
A081010: a(n) = Fibonacci(4n+1) + 2, or Fibonacci(2n-1)*Lucas(2n+2).
-
A081011: a(n) = Fibonacci(4n+3) + 2, or Fibonacci(2n+3)*Lucas(2n).
-
A081012: a(n) = Fibonacci(4n+1) - 2, or Fibonacci(2n+2)*Lucas(2n-1).
-
A081013: a(n) = Fibonacci(4*n+3) - 2, or Fibonacci(2*n)*Lucas(2*n+3).
-
A081014: a(n) = Lucas(4*n+1) + 1, or Lucas(2*n)*Lucas(2*n+1).
-
A081015: a(n) = Lucas(4n+3) + 1, or 5*Fibonacci(2n+1)*Fibonacci(2n+2).
-
A081016: a(n) = (Lucas(4*n+3) + 1)/5, or Fibonacci(2*n+1)*Fibonacci(2*n+2), or A081015(n)/5.
-
A081017: a(n) = Lucas(4n+1) - 1, or 5*Fibonacci(2n)*Fibonacci(2n+1).
-
A081018: a(n) = (Lucas(4n+1)-1)/5, or Fibonacci(2n)*Fibonacci(2n+1), or A081017(n)/5.
-
A081019: a(n) = Lucas(4n+3) - 1, or Lucas(2n+1)*Lucas(2n+2).
-
A081026: Variation on Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = smallest (n odd) or largest (n even) number > a(n-1) that is a unique sum of two distinct earlier terms.
-
A081031: Positions of white keys on piano keyboard, starting with A0 = the 1st key.
-
A081032: Positions of black keys on piano keyboard, starting with A0 = the 1st key.
-
A081037: Inverse binary transform of A027656.
-
A081038: 3rd binomial transform of (1,2,0,0,0,0,0,0,…).
-
A081039: 4th binomial transform of (1,3,0,0,0,0,0,…).
-
A081040: 5th binomial transform of (1,4,0,0,0,0,…).
-
A081041: 6th binomial transform of (1,5,0,0,0,0,0,0,…).
-
A081042: 7th binomial transform of (1,6,0,0,0,0,0,0,…).
-
A081043: 8th binomial transform of (1,7,0,0,0,0,0,…).
-
A081044: 9th binomial transform of (1,8,0,0,0,0,0,0,…).
-
A081045: 10th binomial transform of (1,9,0,0,0,0,0,…).
-
A081046: Difference of the first two Stirling numbers of the first kind.
-
A081057: E.g.f.: Sum_{n>=0} a(n)*x^n/n! = {Sum_{n>=0} F(n+1)*x^n/n!}^2, where F(n) is the n-th Fibonacci number.
-
A081065: Numbers n such that n^2 = (1/3)*(n+floor(sqrt(3)*n*floor(sqrt(3)*n))).
-
A081067: a(n) = Lucas(4n+2)+2, or 5*Fibonacci(2n+1)^2.
-
A081068: a(n) = (Lucas(4*n+2) + 2)/5, or Fibonacci(2*n+1)^2, or A081067(n)/5.
-
A081069: a(n) = Lucas(4n)+2 = Lucas(2n)^2.
-
A081070: Lucas(4n)-2, or 5*Fibonacci(2n)^2.
-
A081071: a(n) = Lucas(4*n+2)-2 = Lucas(2*n+1)^2.
-
A081072: Fibonacci(4*n) + 3, or Fibonacci(2*n+2)*Lucas(2*n-2).
-
A081073: Fibonacci(4n+2)+3, or Fibonacci(2n-1)*Lucas(2n+3).
-
A081074: Fibonacci(4n)-3, or Fibonacci(2n-2)*Lucas(2n+2).
-
A081075: a(n) = Fibonacci(4n+2) - 3.
-
A081076: a(n) = Lucas(4n) + 3, or 5*Fibonacci(2n-1)*Fibonacci(2n+1).
-
A081077: a(n) = Lucas(4*n+2) + 3, or Lucas(2*n)*Lucas(2*n+2).
-
A081078: a(n) = Lucas(4n) - 3, or Lucas(2n-1)*Lucas(2n+1).
-
A081079: a(n) = Lucas(4*n+2) - 3 = 5*Fibonacci(2*n)*Fibonacci(2*n+2).
-
A081090: a(n)^2 + 1 = A081089(n), where A081089(n) = A081088(n+1)/A081088(n); involves the partial quotients of a series of continued fractions that sum to unity.
-
A081104: Duplicate of A079028.
-
A081105: 5th binomial transform of (1,1,0,0,0,0,…).
-
A081106: 6th binomial transform of (1,1,0,0,0,0,…).
-
A081107: 7th binomial transform of (1,1,0,0,0,0,…).
-
A081108: 8th binomial transform of (1,1,0,0,0,0,…).
-
A081109: 9th binomial transform of (1,1,0,0,0,0,0,…).
-
A081122: 10th binomial transform of (1,1,0,0,0,0,…).
-
A081123: a(n) = floor(n/2)!.
-
A081127: 11th binomial transform of (0,1,0,0,0,0,0,…).
-
A081128: 12th binomial transform of (0,1,0,0,0,0,0,0,…).
-
A081132: a(n) = (n+1)^n*binomial(n+2,2).
-
A081133: a(n) = n^n*binomial(n+2, 2).
-
A081139: 9th binomial transform of (0,0,1,0,0,0,…).
-
A081179: 3rd binomial transform of (0,1,0,2,0,4,0,8,0,16,…).
-
A081180: 4th binomial transform of (0,1,0,2,0,4,0,8,0,16,…).
-
A081183: 6th binomial transform of (0,1,0,2,0,4,0,8,0,16,…).
-
A081186: 4th binomial transform of (1,0,1,0,1,…), A059841.
-
A081187: 5th binomial transform of (1,0,1,0,1,…), A059841.
-
A081188: 6th binomial transform of (1,0,1,0,1,…), A059841.
-
A081189: 7th binomial transform of (1,0,1,0,1,…), A059841.
-
A081190: 8th binomial transform of (1,0,1,0,1,…), A059841.
-
A081191: Duplicate of A060531.
-
A081192: 10th binomial transform of (1,0,1,0,1,…), A059841.
-
A081193: a(n) = 6*a(n-1)-8*a(n-2) for n>1, a(0)=1, a(1)=9.
-
A081199: 5th binomial transform of (0,1,0,1,…), A000035.
-
A081200: 6th binomial transform of (0,1,0,1,0,1,…), A000035.
-
A081201: 7th binomial transform of (0,1,0,1,0,1,…), A000035.
-
A081202: 8th binomial transform of (0,1,0,1,0,1,…), A000035.
-
A081203: 9th binomial transform of (0,1,0,1,0,1,…), A000035.
-
A081209: a(n) = Sum_{k=0..n} (-1)^(n-k)*n^k.
-
A081215: a(n) = (n^(n+1)+(-1)^n)/(n+1)^2.
-
A081216: a(n) = (n^n-(-1)^n)/(n+1).
-
A081223: Smallest k such that floor(k*gamma) begins with n (gamma=0.5772156649…).
-
A081237: Numbers n with no k, 0<k<n, such that mu(n-k)=mu(n)=mu(n+k), where mu=A008683 (Moebius function).
-
A081250: Numbers k such that A081249(m)/m^2 has a local minimum for m = k.
-
A081251: Numbers n such that A081249(m)/m^2 has a local maximum for m = n.
-
A081253: Numbers k such that A081252(m)/m^2 has a local minimum for m = k.
-
A081254: Numbers k such that A081252(m)/m^2 has a local maximum for m = k.
-
A081255: Duplicate of A005371.
-
A081266: Staggered diagonal of triangular spiral in A051682.
-
A081267: Diagonal of triangular spiral in A051682.
-
A081268: Diagonal of triangular spiral in A051682.
-
A081269: Duplicate of A064226.
-
A081270: Diagonal of triangular spiral in A051682.
-
A081271: Vertical of triangular spiral in A051682.
-
A081272: Downward vertical of triangular spiral in A051682.
-
A081273: Duplicate of A060544.
-
A081274: Duplicate of A038764.
-
A081275: Shallow diagonal of triangular spiral in A051682.
-
A081276: Floor(n^3/8).
-
A081294: Expansion of (1-2*x)/(1-4*x).
-
A081322: F(P(n)), where F(n) = Fibonacci numbers A000045, P(n) = Pell numbers A000129.
-
A081335: a(n) = (6^n + 2^n)/2.
-
A081336: a(n) = (7^n + 3^n)/2.
-
A081337: a(n) = (8^n + 4^n)/2.
-
A081338: a(n) = (9^n + 5^n)/2.
-
A081340: (5^n+(-1)^n)/2.
-
A081341: Expansion of exp(3*x)*cosh(3*x).
-
A081342: a(n) = (8^n + 2^n)/2.
-
A081343: a(n) = (10^n + 4^n)/2.
-
A081345: First row in maze arrangement of natural numbers A081344.
-
A081346: First column in maze arrangement of natural numbers A081344.
-
A081347: First column in maze arrangement of natural numbers.
-
A081348: First row in maze arrangement of natural numbers.
-
A081351: First row in square maze array of natural numbers A081349.
-
A081352: Main diagonal of square maze arrangement of natural numbers A081349.
-
A081353: Diagonal of square maze arrangement of natural numbers A081349.
-
A081359: Problem 49 on page 235 of “Mathematics”, California Edition, by Carole Greenes et al.
-
A081374: Size of “uniform” Hamming covers of distance 1, that is, Hamming covers in which all vectors of equal weight are treated the same, included or excluded from the cover together.
-
A081405: a(n) = (n+1)*a(n-2) with a(0) = a(1) = 1.
-
A081421: Quotient after one division by 2 of numbers of the form 3^(2n) + 5^(2n).
-
A081423: Subdiagonal of array of n-gonal numbers A081422.
-
A081435: Diagonal in array of n-gonal numbers A081422.
-
A081436: Fifth subdiagonal in array of n-gonal numbers A081422.
-
A081437: Diagonal in array of n-gonal numbers A081422.
-
A081438: Diagonal in array of n-gonal numbers A081422.
-
A081441: a(n) = (2*n^3 - n^2 - n + 2)/2.
-
A081459: Consider the mapping f(r) = (1/2)*(r + N/r) from rationals to rationals where N = 5. Starting with r = 2 and applying the mapping to each new (reduced) rational number gives 2, 9/4, 161/72, 51841/23184, …, tending to N^(1/2). Sequence gives values of the numerators.
-
A081460: Consider the mapping f(r) = (1/2)*(r + N/r) from rationals to rationals where N = 5. Starting with a = 2 and applying the mapping to each new (reduced) rational number gives 2, 9/4, 161/72, 51841/23184, …, tending to N^(1/2). Sequence gives values of the denominators.
-
A081475: Consider the mapping f(x/y) = (x+y)/(2xy) where x/y is a reduced fraction. Beginning with x_0 = 1 and y_0 = 2, repeated application of this mapping produces a sequence of fractions x_n/y_n; a(n) is the n-th numerator.
-
A081476: Consider the mapping f(x/y) = (x+y)/(2xy) where x/y is a reduced fraction. Beginning with x_0 = 1 and y_0 = 2, repeated application of this mapping produces a sequence of fractions x_n/y_n; a(n) is the n-th denominator.
-
A081477: Complement of A086377.
-
A081478: Consider the mapping f(a/b) = (a - b)/(ab). Taking a = 2 and b = 1 to start with and carrying out this mapping repeatedly on each new (reduced) rational number gives the following sequence 2/1,1/2,-1/2,-3/-2,-1/6,… Sequence contains the denominators.
-
A081489: a(n) = n*(2*n^2 -3*n +7)/6 = C(n, 1) + C(n, 2) + 2*C(n, 3).
-
A081490: Leading term of n-th row of A081491.
-
A081494: Start with Pascal’s triangle; form a triangle by sliding down n steps from top on both sides and including the horizontal row, deleting the inner numbers; a(n) = sum of entries on perimeter of triangle.
-
A081495: Start with Pascal’s triangle; form a rhombus by sliding down n steps from top on both sides then sliding down inwards to complete the rhombus and then deleting the inner numbers; a(n) = sum of entries on perimeter of rhombus.
-
A081496: Start with Pascal’s triangle; a(n) is the sum of the numbers on the periphery of the n-th central rhombus containing exactly 4 numbers.
-
A081498: Consider the triangle in which the n-th row starts with n, contains n terms and the difference of successive terms is 1,2,3,… up to n-1. Sequence gives row sums.
-
A081502: Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 3x+y.
-
A081552: Leading terms of rows in A081551.
-
A081553: Sum of n-th row of A081551.
-
A081554: a(n) = sqrt(2)*( (3+2*sqrt(2))^n - (3-2*sqrt(2))^n ).
-
A081555: a(n) = 6*a(n-1) - a(n-2) - 4, a(0)=3, a(1)=7.
-
A081567: Second binomial transform of F(n+1).
-
A081568: Third binomial transform of Fibonacci(n+1).
-
A081569: Fourth binomial transform of F(n+1).
-
A081574: Fourth binomial transform of Fibonacci numbers F(n).
-
A081583: Third row of Pascal-(1,2,1) array A081577.
-
A081585: Third row of Pascal-(1,3,1) array A081578.
-
A081587: Third row of Pascal-(1,4,1) array A081579.
-
A081589: Third row of Pascal-(1,5,1) array A081580.
-
A081591: Third row of Pascal-(1,6,1) array A081581.
-
A081593: Third row of Pascal-(1,7,1) array A081582.
-
A081594: Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 2x+y.
-
A081595: Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 4x+y.
-
A081596: Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 5x+y.
-
A081597: Let n = 10*x + y where 0 <= y <= 9, x >= 0. Then a(n) = 6*x + y.
-
A081598: Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 7x+y.
-
A081599: Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 8x+y.
-
A081600: Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 9x+y.
-
A081604: Number of digits in ternary representation of n.
-
A081618: Numbers n such that (product of first n primes)+1 is divisible by the (n+1)-th prime. Also n such that A075306(n)-1 is equal to A002110(n). Positions of 1 in A081617.
-
A081625: a(n) = 2*5^n - 3^n.
-
A081626: 2*6^n-4^n.
-
A081627: 2*7^n-5^n.
-
A081628: a(n) = 2*(-1)^n - (-5)^n.
-
A081630: 2-(-3)^n.
-
A081631: a(n) = 2*2^n - (-2)^n.
-
A081632: 2*3^n-(-1)^n.
-
A081654: a(n) = 2*4^n - 0^n.
-
A081655: 2*5^n-1.
-
A081656: a(n) = 2*6^n - 2^n.
-
A081657: 2*7^n-3^n.
-
A081659: a(n) = n + Fibonacci(n+1).
-
A081660: n+A001045(n+1).
-
A081661: Partial sums of A081660.
-
A081662: Partial sums of n + Fibonacci(n+1).
-
A081663: a(n) = Fibonacci(2n+1) + n*2^(n-1).
-
A081667: a(n) = Fibonacci(binomial(n+2,2)).
-
A081670: a(n) = 3^n-1+C(2n,n).
-
A081674: Generalized Poly-Bernoulli numbers.
-
A081684: a(n) = 5^n - 4^n - 3^n - 2^n + 3.
-
A081704: Let f(0)=1, f(1)=t, f(n+1) = (f(n)^2+t^n)/f(n-1). f(t) is a polynomial with integer coefficients. Then a(n) = f(n) when t=3.
-
A081714: a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.
-
A081743: a(1)=1 then a(n)=a(n/2^k)+1 if n is even and 2^k is the largest power of 2 dividing n, a(n)=a(n-1) otherwise.
-
A081753: a(n) = floor(n/12) if n == 2 (mod 12); a(n) = floor(n/12) + 1 otherwise.
-
A081808: Numbers n such that the largest prime power in the factorization of n equals phi(n).
-
A081826: Tau-electron mass ratio.
-
A081839: a(1)=0, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
-
A081843: a(1)=0, a(n)=a(n-1)+5 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
-
A081848: Number of numbers whose base-3/2 expansion (see A024629) has n digits.
-
A081908: a(n) = 2^n*(n^2 - n + 8)/8.
-
A081923: Expansion of e.g.f.: exp(2x)/(1-x)^2.
-
A081955: a(n) = 2^r*3^s where r = n(n+1)/2 and s = n(n-1)/2.
-
A081956: Duplicate of A056182.
-
A081972: Consider the geometric progression 1,1/2,1/4,1/8,1/16,1/32,1/64,… Group the terms such that the n-th group contains n terms like this (1/1),(1/2,1/4),(1/8,1/16,1,32),(1/64,1/128,1/256,1/512),… a(n) = floor[1/s(n)] where s(n) is the sum of the members of the n-th group.