Skip to content

Summary of block A069

59 sequences
  • A069015: a(n) = n! * 3^n * Sum_{i=1..n} 1/(i * 3^i).

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

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

  • A069073: a(n) = n*(4n^2 - 1)^2.

  • A069074: a(n) = (2*n+2)*(2*n+3)*(2*n+4) = 24*A000330(n+1).

  • A069075: a(n) = (4*n^2 - 1)^2.

  • A069076: a(n) = (4*n^2 - 1)^3.

  • A069078: a(n) = n*(4*n^4 + 1).

  • A069079: a(n) = (2*n+1)*(2*n+2)*(2*n+4)*(2*n+5).

  • A069099: Centered heptagonal numbers.

  • A069121: a(n) = n^4*binomial(2n,n).

  • A069125: a(n) = (11*n^2 - 11*n + 2)/2.

  • A069126: Centered 13-gonal numbers.

  • A069127: Centered 14-gonal numbers.

  • A069128: Centered 15-gonal numbers: a(n) = (15*n^2 - 15*n + 2)/2.

  • A069129: Centered 16-gonal numbers.

  • A069130: Centered 17-gonal numbers: (17*n^2 - 17*n + 2)/2.

  • A069131: Centered 18-gonal numbers.

  • A069132: Centered 19-gonal numbers.

  • A069133: Centered 20-gonal (or icosagonal) numbers.

  • A069134: (n!*(3*n))^2.

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

  • A069140: a(n) = (4*n-1)*4*n*(4*n+1).

  • A069173: Centered 22-gonal numbers.

  • A069174: Centered 23-gonal numbers.

  • A069178: Centered 21-gonal numbers.

  • A069190: Centered 24-gonal numbers.

  • A069210: a(1)=a(2)=1, a(n+2) = a(n+1)+1 if sign(sin(a(n+1))) = sign(sin(a(n))), a(n+2) = a(n)+1 otherwise.

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

  • A069306: Number of 2 X n binary arrays with a path of adjacent 1’s from upper left corner to anywhere in right hand column.

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

  • A069429: Half the number of 3 X n binary arrays with no path of adjacent 1’s or adjacent 0’s from top row to bottom row.

  • A069476: First differences of A069475, successive differences of (n+1)^6-n^6.

  • A069478: First differences of A069477, successive differences of (n+1)^5 - n^5.

  • A069506: a(1) = 2; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.

  • A069515: Number of transpositions (interchanges of adjacent digits, sometimes called inversions) needed to change all n-digit base 3 numbers into nondecreasing order.

  • A069517: a(n) = (-1)*Sum_{d|n} (moebius(d)*(-1)^d).

  • A069566: a(1)=0; for n >= 2, a(n) = smallest value of k such that the concatenation 1,n,n^2,…, n^(k-1), n^k,n^(k-1),…n^2,n,1 is a prime.

  • A069651: For n >= 1, let M_n be the n X n matrix with M_n(i,j) = i^2/(i+j); then a(n) = 1/det(M_n). Also, a(0) = 1 by convention.

  • A069705: a(n) = 2^n mod 7.

  • A069720: a(n) = 2^(n-1)*binomial(2*n-1, n).

  • A069721: Number of rooted unicursal planar maps with n edges and no vertices of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).

  • A069722: Number of rooted unicursal planar maps with n edges and exactly one vertex of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).

  • A069723: a(n) = 2^(n-1)*binomial(2*n-3, n-1).

  • A069731: Number of unicursal planar maps with n edges rooted at a vertex of odd valency (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).

  • A069756: Frobenius number of the numerical semigroup generated by consecutive squares.

  • A069760: Frobenius number of the numerical semigroup generated by consecutive centered square numbers.

  • A069778: q-factorial numbers 3!_q.

  • A069779: q-factorial numbers 4!_q.

  • A069813: Maximum number of triangles in polyiamond with perimeter n.

  • A069816: a(n) = (sum of digits of n)^2 - (sum of digits^2 of n).

  • A069834: a(n) = n-th reduced triangular number: n*(n+1)/{2^k} where 2^k is the largest power of 2 that divides product n*(n+1).

  • A069894: Centered square numbers: a(n) = 4*n^2 + 4*n + 2.

  • A069905: Number of partitions of n into 3 positive parts.

  • A069908: Numbers congruent to +-2, +-3, +-4 or +-5 mod 16.

  • A069909: Numbers congruent to +-1, +-4, +-6, +-7 mod 16.

  • A069975: a(n) = n*(16*n^2 - 1).

  • A069976: Interior angle of a regular polygon of n sides, rounded to nearest integer.

  • A069993: a(n) = 2^(2n+1)*Sum_{k=1..2*n} binomial(2n+1,k)*Bernoulli(k)/2^k.