Skip to content

Summary of block A066

84 sequences
  • A066000: Size of smallest directed 1-covering code of length n.

  • A066023: (a(n)^7+1)/(n^7+1) is the smallest integer > 1.

  • A066043: a(1) = 1; for m > 0, a(2m) = 2m, a(2m+1) = 4m+2.

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

  • A066068: a(n) = n^n + n.

  • A066070: a(1) = 1; for m > 0, a(2m) = 2(2m+1), a(2m+1) = 2m+1.

  • A066084: a(n) = (n!)^2 + n! + n.

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

  • A066093: Duplicate of A022342.

  • A066095: Duplicate of A003622.

  • A066096: a(n) = floor(n*phi), where phi = (1 + sqrt(5))/2.

  • A066097: Duplicate of A035336.

  • A066104: a(2n) = 2n, a(2n+1) = 4(n+1).

  • A066114: a(0) = 1; for n > 0, a(n) = (n!*(3*n+1))/2.

  • A066118: a(n) = n!*(3*n-1)/2.

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

  • A066140: Covering numbers C(n,n-3,n-4).

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

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

  • A066143: a(n) = n! + n^2 + n.

  • A066164: Sum of interior angles in an n-sided polygon in degrees.

  • A066209: A053041(n)-10^(n-1).

  • A066210: a(n) = ((2*n)^(2*n+2) - 1)/(4*n^2 - 1).

  • A066211: a(n) = Sum_{j=0..n} (2*n)!/(2*n-j)!.

  • A066237: First differences give A052849.

  • A066247: Characteristic function of composite numbers: 1 if n is composite else 0.

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

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

  • A066267: Numbers k such that A066266(k) is prime.

  • A066269: Indices of primes in A066268.

  • A066274: Number of endofunctions of [n] such that 1 is not a fixed point.

  • A066275: Number of endofunctions of [n] such that some element is fixed, but 1 is not fixed.

  • A066298: a(n) = googol (mod n).

  • A066300: Number of n X n matrices with exactly 2 1’s in each row, other entries 0.

  • A066305: Number of connected reduced partially ordered sets (posets) with n unlabeled elements.

  • A066318: Number of necklaces with n labeled beads of 2 colors.

  • A066319: A labeled structure simultaneously a tree and a cycle.

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

  • A066370: Quadruply triangular numbers.

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

  • A066375: a(n) = 6*binomial(n,4) + 3*binomial(n,3) + 4*binomial(n,2) - n + 2.

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

  • A066438: a(n) = 7^n mod n.

  • A066439: a(n) = 8^n mod n.

  • A066440: a(n) = 9^n mod n.

  • A066441: a(n) = 11^n mod n.

  • A066442: a(n) = 12^n mod n.

  • A066443: Number of distinct paths of length 2n+1 along edges of a unit cube between two fixed adjacent vertices.

  • A066455: a(n) = 6*binomial(n,4) + 5*binomial(n,2) - 4*n + 5.

  • A066481: Largest anti-divisor of n.

  • A066494: Numbers n such that prime(n+1) - prime(n) = phi(n).

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

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

  • A066532: If n is odd a(n) = 1, if n is even a(n) = 2^(n-1).

  • A066533: Erroneous version of A058986.

  • A066534: Total number of walks with length > 0 in the Hasse diagram of a Boolean algebra of order n.

  • A066557: Largest n-digit multiple of n.

  • A066558: a(n) = A066557(n)/n.

  • A066559: a(n) = ceiling(10^(n-1)/n).

  • A066560: Smallest composite number divisible by n.

  • A066587: Duplicate of A047621.

  • A066601: a(n) = 3^n mod n.

  • A066602: a(n) = 4^n mod n.

  • A066603: a(n) = 5^n mod n.

  • A066604: a(n) = 6^n mod n.

  • A066606: a(n) = 2^n mod n^2.

  • A066607: a(n) = 3^n mod n^3.

  • A066614: Erroneous version of A053614.

  • A066615: Numbers that are not the sum of two or three distinct primes.

  • A066629: a(n) = 2*Fibonacci(n+2) + ((-1)^n - 3)/2.

  • A066719: Numbers k such that 1 + k^phi(k) is prime.

  • A066771: a(n) = 5^n*cos(2*n*arctan(1/2)) or denominator of tan(2*n*arctan(1/2)).

  • A066796: a(n) = Sum_{i=1..n} binomial(2*i,i).

  • A066802: a(n) = binomial(6*n,3*n).

  • A066804: Sum of diagonal elements and those below it for a square matrix of integers, starting with 1.

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

  • A066827: a(n) = gcd(2^((n*(n+1)/2)) + 1, 2^n + 1).

  • A066830: a(n) = lcm(n+1, n-1).

  • A066901: Let phi(k) determine the x-coordinate and prime(k) the y-coordinate of the point A(k). Sequence gives values of n such that points A(n), A(n+1) and A(n+2) form a right triangle with right angle at A(n+1).

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

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

  • A066983: a(n+2) = a(n+1) + a(n) + (-1)^n, with a(1) = a(2) = 1.

  • A066998: a(0)=0; a(n) = n^2*a(n-1) + 1.

  • A066999: a(n) = 3^n * Sum_{i=1..n} i^3/3^i.