Skip to content

Summary of block A059

78 sequences
  • A059020: Number of 2 X n checkerboards (with at least one red square) in which the set of red squares is edge connected.

  • A059029: a(n) = n if n is even, 2*n + 1 if n is odd.

  • A059100: a(n) = n^2 + 2.

  • A059133: A hierarchical sequence (S(W2{2}c) - see A059126).

  • A059138: A hierarchical sequence (S(W3{2,2}cc) - see A059126).

  • A059140: A hierarchical sequence (S(W2{2}*c) - see A059126).

  • A059142: A hierarchical sequence (S(W2{3}*) - see A059126).

  • A059145: A hierarchical sequence (S(W3{2,2}*cc) - see A059126).

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

  • A059155: A hierarchical sequence (S(W’2{3}c) - see A059126).

  • A059162: A hierarchical sequence (S(W’2{3}*c) - see A059126).

  • A059169: Number of partitions of n into 3 parts which form the sides of a nondegenerate isosceles triangle.

  • A059171: Size of largest conjugacy class in S_n, the symmetric group on n symbols.

  • A059193: Engel expansion of 1/e = 0.367879… .

  • A059204: Number of non-unimodal permutations of n items (i.e., those which do not simply go up for the first part and then down for the rest, but at some point go down then up).

  • A059222: Minimal number of disjoint edge-paths into which the graph of the n-ary cube can be partitioned.

  • A059224: a(n) = 2^(n-3)*(n + 3)*(2*n - 3).

  • A059232: a(1)= 1, a(n) = (a(n-1)^a(n-1)) + n.

  • A059270: a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers.

  • A059288: a(n) = binomial(2*n,n) mod n.

  • A059289: a(n) = 1 + (binomial(2n,n) mod n).

  • A059302: A diagonal of A008296.

  • A059304: a(n) = 2^n * (2*n)! / (n!)^2.

  • A059329: Number of 3 X 3 matrices, with elements from {0,…,n}, having the property that the middle element of each of the eight 3-element horizontal, vertical and diagonal lines equals the average of the two end elements.

  • A059332: Determinant of n X n matrix A defined by A[i,j] = (i+j-1)! for 1 <= i,j <= n.

  • A059387: Jordan function J_n(6) (see A059379).

  • A059403: Quarter-squared applied twice.

  • A059406: a(n) = a(n-1)*(3a(n-1) + 1)/2 with a(1) = 1.

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

  • A059410: J_n(9) (see A059379).

  • A059482: a(0)=1, a(n) = a(n-1) + 8*10^(n-1).

  • A059512: For n>=2, the number of (s(0), s(1), …, s(n-1)) such that 0 < s(i) < 5 and |s(i) - s(i-1)| <= 1 for i = 1,2,…,n-1, s(0) = 2, s(n-1) = 2.

  • A059557: Beatty sequence for 1 + gamma^2, (gamma is the Euler-Mascheroni constant A001620).

  • A059570: Number of fixed points in all 231-avoiding involutions in S_n.

  • A059620: Colors of the 88 keys of the standard piano: white keys = 0, black keys = 1, start with A0 = the 0th key.

  • A059672: Sum of binary numbers with n 1’s and one (possibly leading) 0.

  • A059673: Sum of binary numbers with n 1’s and one (non-leading) 0.

  • A059687: Number of basic circuits of nullity n.

  • A059709: Numbers k such that A003266(k) - 1 is prime.

  • A059721: Mean of first six positive powers of n, i.e., (n + n^2 + n^3 + n^4 + n^5 + n^6)/6.

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

  • A059723: Mean of the first 2^n nonnegative powers of 3, i.e., (1 + 3 + 3^2 + … + 3^(2^n-1))/2^n.

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

  • A059730: Third diagonal of A059922.

  • A059765: Possible sizes of the torsion group of an elliptic curve over the rationals Q. This is a finite sequence.

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

  • A059827: Cubes of triangular numbers: (n*(n+1)/2)^3.

  • A059830: a(n) = n^6 + n^4 + n^2 + 1.

  • A059834: Sum of squares of entries of Wilkinson’s eigenvalue test matrix of order 2n+1.

  • A059837: Diagonal T(s,s) of triangle A059836.

  • A059839: a(n) = n^8 + n^6 + n^4 + n^2 + 1.

  • A059840: a(n) = F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045.

  • A059841: Period 2: Repeat [1,0]. a(n) = 1 - (n mod 2); Characteristic function of even numbers.

  • A059845: a(n) = n*(3*n + 11)/2.

  • A059855: Period of continued fraction for sqrt(n^2+4), n >= 1.

  • A059859: Sum of squares of first n quarter-squares (A002620).

  • A059860: a(n) = binomial(n+1, 2)^5.

  • A059917: a(n) = (3^(2^n) + 1)/2 = A059919(n)/2, n >= 0.

  • A059918: a(n) = (3^(2^n)-1)/2.

  • A059919: Generalized Fermat numbers: 3^(2^n)+1, n >= 0.

  • A059924: Write the numbers from 1 to n^2 in a spiraling square; a(n) is the total of the sums of the two diagonals.

  • A059929: a(n) = Fibonacci(n)*Fibonacci(n+2).

  • A059937: Sum of binary numbers with n 1’s and two (possibly leading) 0’s.

  • A059938: Sum of binary numbers with n 1’s and two (non-leading) 0’s.

  • A059939: a(n) = floor(log_2(n+1) - 1).

  • A059944: Denominators of Maclaurin series coefficients for 2*cos(x/sqrt(3) + arctan(-sqrt(3))) = cos(x/sqrt(3)) + sqrt(3)*sin(x/sqrt(3)).

  • A059945: Number of 4-block bicoverings of an n-set.

  • A059953: Ordering of a deck of 52 cards after an out-shuffle.

  • A059977: a(n) = binomial(n+2, 2)^4.

  • A059978: a(n) = binomial(n+2,n)^6.

  • A059979: Number of 7-dimensional cage assemblies.

  • A059980: Number of 8-dimensional cage assemblies.

  • A059986: Number of rods required to make a 3-D cube of side length n.

  • A059988: a(n) = (10^n - 1)^2.

  • A059989: Numbers n such that 3*n+1 and 4*n+1 are both squares.

  • A059993: Pinwheel numbers: a(n) = 2*n^2 + 6*n + 1.

  • A059995: Drop the final digit of n.

  • A059997: a(n) = (n/2)*(n + 1)*(3*n + 11).