Skip to content

Summary of block A099

132 sequences
  • A099003: Number of 4 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (10;0) and (11;0).

  • A099012: a(n) = 3^(n-1)*Fibonacci(n).

  • A099016: a(n) = 3*L(2*n)/5 - (-1)^n/5, where L = A000032.

  • A099018: Duplicate of A033484.

  • A099025: Expansion of 1 / ((1+x) * (1-5*x+x^2)).

  • A099035: a(n) = (n+1)*2^(n-1) - 1.

  • A099036: a(n) = 2^n - Fibonacci(n).

  • A099041: Number of 3 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (10;0) and (10;1).

  • A099044: a(n) = (2*0^n + 3^n*binomial(2*n,n))/3.

  • A099045: a(n) = (3*0^n + 4^n*binomial(2*n,n))/4.

  • A099046: a(n) = (4*0^n + 5^n*binomial(2*n,n))/5.

  • A099048: Number of 5 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (10;0) and (11;0).

  • A099081: Numbers k such that 1.2. … .k-1.k + 1 is prime (where dot between numbers means concatenation).

  • A099087: Expansion of 1/(1 - 2*x + 2*x^2).

  • A099100: a(n) = Fibonacci(5*n+1).

  • A099133: 4^(n-1)*Fibonacci(n).

  • A099137: Iterated pentagonal numbers starting with 2.

  • A099140: a(n) = 4^n * T(n,3/2) where T is the Chebyshev polynomial of the first kind.

  • A099141: a(n) = 5^n * T(n,7/5) where T is the Chebyshev polynomial of the first kind.

  • A099142: a(n) = 6^n * T(n, 4/3) where T is the Chebyshev polynomial of the first kind.

  • A099147: Iterated hexagonal numbers, starting at 1.

  • A099150: Positive integers k such that f(k)+f(k)=concatenation of k and k, where f(k)=k(k+3)/2 (A000096).

  • A099151: Positive integers a such that f(3a)+f(a)=concatenation of 3a and a, where f(k)=k(k+3)/2 (A000096).

  • A099156: a(n) = 2^(n-1)*ChebyshevU(n-1, 2).

  • A099157: a(n) = 4^(n-1)*U(n-1, 3/2) where U is the Chebyshev polynomial of the second kind.

  • A099158: a(n) = 5^(n-1) * U(n-1, 7/5) where U is the Chebyshev polynomial of the second kind.

  • A099164: (L(n+2)+2*3^n)/5.

  • A099166: G.f.: (1+x^2)/((1-2x)(1-x-x^2)); a(n)=3a(n-1)-a(n-2)-2a(n-3); a(n)=5*2^n-L(n+3); a(n)=sum{k=0..n, (L(k)-0^k)2^(n-k)}.

  • A099167: G.f.: (1+x^2)/((1-3x)(1-x-x^2)).

  • A099168: a(n) = 3^n * 5^binomial(n,2).

  • A099175: a(1) = 1, a(2) = 8; for n > 2: a(n) = a(n-1)*(3*a(n-1)-2).

  • A099176: a(n) = 2*a(n-1) + 4*a(n-2) - 4*a(n-3) - 4*a(n-4).

  • A099177: a(n)=2a(n-1)+4a(n-2)-4a(n-3)-4a(n-4).

  • A099179: Iterated tetrahedral numbers.

  • A099185: Iterated octahedral numbers, starting at a(0) = 2.

  • A099188: a(n) = 2*ceiling(n/sqrt(2)).

  • A099202: a(n) = 2^floor(n^2/2).

  • A099215: a(n)=4a(n-1)-4a(n-2)+3a(n-3).

  • A099232: a(n) = 2*a(n-1) + 2*a(n-2) - 3*a(n-3), with a(0) = 0, a(1) = 1, a(2) = 2.

  • A099254: Self-convolution of A010892. The g.f. is 1/(Alexander polynomial of granny knot).

  • A099260: Number of decimal digits in (10^n)-th prime number.

  • A099267: Numbers generated by the golden sieve.

  • A099270: Unsigned member r=-12 of the family of Chebyshev sequences S_r(n) defined in A092184.

  • A099279: Squares of A001076.

  • A099359: a(n) = (2^n + 1)^3 - 2.

  • A099360: a(n) = (2^n + 1)^4 - 2.

  • A099370: Chebyshev polynomial of the first kind, T(n,x), evaluated at x=33.

  • A099371: Expansion of g.f.: x/(1 - 9*x - x^2).

  • A099392: a(n) = floor((n^2 - 2*n + 3)/2).

  • A099393: a(n) = 4^n + 2^n - 1.

  • A099396: a(n) = floor(log_2((2/3)*n)) for n >= 2, a(1) = 0.

  • A099425: Expansion of (1+x^2)/(1-2*x-x^2).

  • A099428: Duplicate of A099920.

  • A099429: A Jacobsthal-Lucas convolution.

  • A099430: a(n) = 2^n+(-1)^n-1.

  • A099431: Expansion of x(1-2x+3x^2)/(1-x-2x)^2;.

  • A099443: A Chebyshev transform of Fib(n+1).

  • A099450: Expansion of 1/(1 - 5x + 7x^2).

  • A099453: Expansion of 1/(1 - 7*x + 11*x^2).

  • A099456: Expansion of 1/(1 - 4*x + 5*x^2).

  • A099459: Expansion of 1/(1 - 7*x + 9*x^2).

  • A099479: Count, repeating 4n three times for n > 0.

  • A099480: Count from 1, repeating 2*n five times.

  • A099483: A Fibonacci convolution.

  • A099485: A Fibonacci convolution.

  • A099486: Expansion of x/((1 + x^2)*(1 - 4*x + x^2)).

  • A099488: Expansion of (1-x)^2/((1+x^2)*(1-4*x+x^2)).

  • A099489: Expansion of (1-x+x^2)/((1+x^2)(1-4x+x^2)).

  • A099496: a(n) = (-1)^n * Fibonacci(2*n+1).

  • A099517: A transform of (1-x)/(1-2x).

  • A099544: Odd part of n modulo 3.

  • A099545: Odd part of n, modulo 4.

  • A099546: Odd part of n modulo 5.

  • A099547: Odd part of n modulo 6.

  • A099548: Odd part of n modulo 7.

  • A099549: Odd part of n modulo 8.

  • A099550: Odd part of n modulo 9.

  • A099551: Odd part of n modulo 10. Final digit of A000265(n).

  • A099563: a(0) = 0; for n > 0, a(n) = final nonzero number in the sequence n, f(n,2), f(f(n,2),3), f(f(f(n,2),3),4),…, where f(n,d) = floor(n/d); the most significant digit in the factorial base representation of n.

  • A099582: a(n) = Sum_{k=0..floor(n/2)} binomial(n-k, k-1)*4^(n-k-1).

  • A099603: Row sums of triangle A099602, in which row n equals the inverse binomial transform of column n of the triangle of trinomial coefficients (A027907).

  • A099606: Row sums of triangle A099605, in which row n equals the inverse Binomial transform of column n of the triangle A034870 of even-indexed rows of Pascal’s triangle.

  • A099639: Duplicate of A003555.

  • A099669: Partial sums of repdigits of A002276.

  • A099670: Partial sums of repdigits of A002277.

  • A099671: Partial sums of repdigits of A002278.

  • A099672: Partial sums of repdigits of A002279.

  • A099673: Partial sums of repdigits of A002280.

  • A099675: Partial sums of repdigits of A002282.

  • A099676: Partial sums of repdigits of A002283.

  • A099721: a(n) = n^2*(2*n+1).

  • A099753: a(n) = (2*n+1)^(n+2).

  • A099754: a(n) = (3^n +1)/2 + 2^n.

  • A099758: Duplicate of A099760.

  • A099760: a(n+1) = 2*n*a(n) + 2 with a(0)=1.

  • A099761: a(n) = ( n*(n+2) )^2.

  • A099762: a(n) = n^2 * (n+1)^3.

  • A099764: a(n) = n^2 * (n+1)^2 * (n+2)^2 = 36*A001249(n-1).

  • A099776: Length of the hypotenuse of an integer right triangle with the hypotenuse being one more than the longer side. The shorter sides are just consecutive odd numbers 3, 5, 7, …

  • A099780: a(n) = Sum_{k=0..floor(n/3)} C(n-k, 2*k) * 2^k*3^(n-3*k).

  • A099814: Bisection of A002275.

  • A099837: Expansion of (1 - x^2) / (1 + x + x^2) in powers of x.

  • A099838: Expansion of (1-x)^2*(1+x)/(1+x+x^2).

  • A099843: A transform of the Fibonacci numbers.

  • A099856: Expansion of (1+3*x)/(1-3*x).

  • A099857: Expansion of (1+3x+x^2)/(1-3x+x^2).

  • A099867: a(n) = 5*a(n-1) - a(n-2) for n>1, a(0)=1, a(1)=9.

  • A099894: XOR BINOMIAL transform of A038712.

  • A099895: XOR BINOMIAL transform of A000069 (Odious numbers).

  • A099903: Sum of all matrix elements of n X n matrix M(i,j) = i^3+j^3, (i,j = 1..n). a(n) = n^3*(n+1)^2/2.

  • A099905: a(n) = binomial(2n-1, n-1) mod n.

  • A099913: Related to the Herschel graph.

  • A099914: Expansion of (1+3x)/((1-x)(1-10x)).

  • A099915: Expansion of g.f. (1+4*x)/((1-x)*(1-10*x)).

  • A099919: a(n) = F(3) + F(6) + F(9) + … + F(3n), F(n) = Fibonacci numbers A000045.

  • A099920: a(n) = (n+1)*F(n), F(n) = Fibonacci numbers A000045.

  • A099921: a(n) = 5*Fibonacci(n)^2.

  • A099922: a(n) = F(4n) - 2n, where F(n) = Fibonacci numbers A000045.

  • A099923: Fourth powers of Lucas numbers A000032.

  • A099924: Self-convolution of Lucas numbers.

  • A099925: a(n) = Lucas(n) + (-1)^n.

  • A099926: Duplicate of A098600.

  • A099938: Consider the sequence of circles C0, C1, C2, C3 …, where C0 is a half-circle of radius 1. C1 is the largest circle that fits into C0 and has radius 1/2. C(n+1) is the largest circle that fits inside C0 but outside C(n), etc. Sequence gives the curvatures (reciprocals of the radii) of the circles.

  • A099941: a(0) = 4; for n>0, a(n) = a(n-1)^2 - 10.

  • A099943: Number of 5 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01,1) and (11;0).

  • A099944: Number of 3 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1) and (11;0).

  • A099945: Number of 4 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1) and (11;0).

  • A099951: Length of shortest maximal Abelian squarefree word over alphabet of size n.

  • A099953: a(n) = A076795(n) - 1.

  • A099955: Atomic numbers in first column in the Mendeleyev periodic table of elements.

  • A099956: Atomic numbers of the alkaline earth metals.

  • A099976: Bisection of A000984.