Skip to content

Summary of block A049

73 sequences
  • A049008: Greatest possible number of right angles that can occur as interior angles in a planar n-gon.

  • A049013: Duplicate of A020735.

  • A049039: Geometric Connell sequence: 1 odd, 2 even, 4 odd, 8 even, …

  • A049068: Complement of quarter-squares (A002620).

  • A049071: Expansion of x*(3-2*x)/(1-x^2).

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

  • A049206: Maximum mean distance between cards during perfect faro shuffles, with cut, to return to original order in A024222.

  • A049209: a(n) = -Product_{k=0..n} (7*k-1); sept-factorial numbers.

  • A049210: a(n) = -Product_{k=0..n} (8*k-1); octo-factorial numbers.

  • A049211: a(n) = Product_{k=1..n} (9*k - 1); 9-factorial numbers.

  • A049212: a(n) = -Product_{k=0..n} (10*k - 1); deca-factorial numbers.

  • A049294: Number of subgroups of index 3 in free group of rank n+1.

  • A049308: Sextuple factorial numbers: Product_{k=0..n-1} (6*k+4).

  • A049332: Number of conjugacy classes in Clifford group CL(n).

  • A049341: a(n+1) = sum of digits of a(n) + a(n-1).

  • A049342: a(n) = A049341(n)/3.

  • A049384: a(0)=1, a(n+1) = (n+1)^a(n).

  • A049386: Binary order of 2^n-th prime.

  • A049388: a(n) = (n+7)!/7!.

  • A049389: a(n) = (n+8)!/8!.

  • A049398: a(n) = (n+9)!/9!.

  • A049450: Pentagonal numbers multiplied by 2: a(n) = n*(3*n-1).

  • A049451: Twice second pentagonal numbers.

  • A049452: Pentagonal numbers with even index.

  • A049453: Second pentagonal numbers with even index: a(n) = n*(6*n+1).

  • A049472: a(n) = floor(n/sqrt(2)).

  • A049473: Nearest integer to n/sqrt(2).

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

  • A049480: a(n) = (2*n-1)*(n^2 -n +6)/6.

  • A049486: Maximum length of non-crossing path on n X n square lattice.

  • A049598: 12 times triangular numbers.

  • A049601: a(n)=Sum{T(2i,n-2i): i=0,1,…,[ n/2 ]}, array T as in A049600.

  • A049602: a(n) = (Fibonacci(2*n)-(-1)^n*Fibonacci(n))/2.

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

  • A049611: a(n) = T(n,2), array T as in A049600.

  • A049625: Congruent to 1, 2, 4, 6, 8 or 9 mod 11, but with 2 instead of 1.

  • A049626: a(n) = T(n,4), array T as in A049615.

  • A049629: a(n) = (F(6*n+5) - F(6*n+1))/4 = (F(6*n+4) + F(6*n+2))/4, where F = A000045.

  • A049636: Congruent to 0 or 2 mod 3, but not equal to 0 or 3.

  • A049637: Congruent to 2, 3, 6, 8, 10 or 12 mod 13, but not equal to 3.

  • A049638: a(n) = T(n,4), array T as in A049627.

  • A049651: a(n) = (F(3*n+1) - 1)/2, where F=A000045 (the Fibonacci sequence).

  • A049652: a(n) = (F(3*n+2) - 1)/4, where F=A000045 (the Fibonacci sequence).

  • A049654: a(n) = (F(8*n+1) - 1)/3 where F=A000045 (the Fibonacci sequence).

  • A049655: a(n) = (F(8n+2)-1)/3, where F=A000045 (the Fibonacci sequence).

  • A049656: a(n) = (F(8n+7)-1)/3, where F=A000045 (the Fibonacci sequence).

  • A049657: a(n) = (F(8*n+3) - 2)/3, where F = A000045 (the Fibonacci sequence).

  • A049658: a(n) = (F(8*n+5) - 2)/3, where F = A000045 (the Fibonacci sequence).

  • A049659: a(n) = (F(8*n+6) - 2)/3, where F=A000045 (the Fibonacci sequence).

  • A049660: a(n) = Fibonacci(6*n)/8.

  • A049661: a(n) = (Fibonacci(6*n+1) - 1)/4.

  • A049662: a(n) = (F(6*n+2)-1)/4, where F=A000045 (the Fibonacci sequence).

  • A049663: a(n) = (F(6*n+5) - 1)/4, where F = A000045 (the Fibonacci sequence).

  • A049664: a(n) = (F(6*n+3) - 2)/32, where F = A000045 (the Fibonacci sequence).

  • A049665: a(n) = (F(6*n+4) - 3)/4, where F=A000045 (the Fibonacci sequence).

  • A049666: a(n) = Fibonacci(5*n)/5.

  • A049667: a(n) = Fibonacci(7*n)/13.

  • A049668: a(n) = Fibonacci(8*n)/21.

  • A049669: a(n) = Fibonacci(9*n)/34.

  • A049672: a(n) = (F(4*n) - F(n))/2, where F=A000045 (the Fibonacci sequence).

  • A049676: a(n) = (F(8*n+3) + F(8*n+1))/3, where F = A000045 (the Fibonacci sequence).

  • A049677: a(n) = (F(8*n+6) + F(8*n+1))/3, where F = A000045 (the Fibonacci sequence).

  • A049678: a(n) = F(8*n+4)/3, where F=A000045 (the Fibonacci sequence).

  • A049679: a(n) = (F(8*n+7)+F(8*n+5))/3, where F=A000045 (the Fibonacci sequence).

  • A049681: a(n) = (Lucas(2*n) - Lucas(n))/2.

  • A049683: a(n) = (Lucas(6*n) - 2)/16.

  • A049684: a(n) = Fibonacci(2n)^2.

  • A049685: a(n) = L(4*n+2)/3, where L=A000032 (the Lucas sequence).

  • A049686: a(n) = Fibonacci(8n)/3.

  • A049775: a(n) is the sum of all integers from 2^(n-2)+1 to 2^(n-1).

  • A049778: a(n) = Sum_{k=1..floor((n+1)/2)} T(n,2k-1), array T as in A049777.

  • A049779: a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.

  • A049782: a(n) = (0! + 1! + … + (n-1)!) mod n.