Skip to content

Summary of block A057

95 sequences
  • A057009: Number of conjugacy classes of subgroups of index 3 in free group of rank n.

  • A057010: Number of conjugacy classes of subgroups of index 4 in free group of rank n.

  • A057029: Central column of arrays in A057027 and A057028.

  • A057036: Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; …; each k is an R(i(k),j(k)) and A057036(n)=i(2n-1).

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

  • A057066: a(n) = floor(4^4/n).

  • A057067: a(n) = floor(5^5/n).

  • A057068: a(n) = floor(6^6/n).

  • A057069: a(n) = floor(7^7/n).

  • A057070: a(n) = floor(8^8/n).

  • A057071: a(n) = floor(9^9/n).

  • A057072: a(n) = floor(10^10/n).

  • A057073: a(n) = floor(11^11/n).

  • A057074: a(n) = floor(12^12/n).

  • A057076: A Chebyshev or generalized Fibonacci sequence.

  • A057077: Periodic sequence 1,1,-1,-1; expansion of (1+x)/(1+x^2).

  • A057078: Periodic sequence 1,0,-1,…; expansion of (1+x)/(1+x+x^2).

  • A057079: Periodic sequence: repeat [1,2,1,-1,-2,-1]; expansion of (1+x)/(1-x+x^2).

  • A057080: Even-indexed Chebyshev U-polynomials evaluated at sqrt(10)/2.

  • A057081: Even-indexed Chebyshev U-polynomials evaluated at sqrt(11)/2.

  • A057083: Scaled Chebyshev U-polynomials evaluated at sqrt(3)/2; expansion of 1/(1 - 3*x + 3*x^2).

  • A057084: Scaled Chebyshev U-polynomials evaluated at sqrt(2).

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

  • A057086: Scaled Chebyshev U-polynomials evaluated at sqrt(10)/2.

  • A057087: Scaled Chebyshev U-polynomials evaluated at i. Generalized Fibonacci sequence.

  • A057088: Scaled Chebyshev U-polynomials evaluated at i*sqrt(5)/2. Generalized Fibonacci sequence.

  • A057089: Scaled Chebyshev U-polynomials evaluated at i*sqrt(6)/2. Generalized Fibonacci sequence.

  • A057090: Scaled Chebyshev U-polynomials evaluated at i*sqrt(7)/2. Generalized Fibonacci sequence.

  • A057091: Scaled Chebyshev U-polynomials evaluated at i*sqrt(2). Generalized Fibonacci sequence.

  • A057092: Scaled Chebyshev U-polynomials evaluated at i*3/2. Generalized Fibonacci sequence.

  • A057093: Scaled Chebyshev U-polynomials evaluated at i*sqrt(10)/2. Generalized Fibonacci sequence.

  • A057156: Number of functions from {0,1}^n to {0,1}^n.

  • A057157: Number of non-invertible functions from {0,1}^n to {0,1}^n.

  • A057174: a(n+3)=a(n)+a(n+1)-a(n+2), starting with 1,2,3.

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

  • A057211: Alternating runs of ones and zeros, where the n-th run has length n.

  • A057212: n-th run has length n.

  • A057224: Numbers k such that (Product of first k Mersenne prime exponents) + 1 is prime.

  • A057241: Circuit cost of the hardest Boolean function of n variables; metric: 2-input AND-gates cost 1, NOT is free, fanout is free, inputs are free, no feedback allowed.

  • A057268: a(n-1)+k=a(n) => a(n)*k=a(n+1).

  • A057269: a(n-1)+k=a(n) => a(n)^k=a(n+1).

  • A057347: Leap years in the Islamic calendar starting year 1 AH (Anno Hegirae) = 622 CE (Common Era or AD). There are 11 leap years in a 30 year cycle.

  • A057349: Leap years in the Hebrew Calendar starting in year 1 (3761 BCE). The leap year has an extra month.

  • A057353: a(n) = floor(3n/4).

  • A057354: a(n) = floor(2*n/5).

  • A057355: a(n) = floor(3*n/5).

  • A057356: a(n) = floor(2*n/7).

  • A057357: a(n) = floor(3*n/7).

  • A057358: a(n) = floor(4*n/7).

  • A057360: a(n) = floor(3*n/8).

  • A057361: a(n) = floor(5*n/8).

  • A057362: a(n) = floor(5*n/13).

  • A057363: a(n) = floor(8*n/13).

  • A057364: a(n) = floor(8*n/21).

  • A057365: a(n) = floor(13*n/21).

  • A057366: a(n) = floor(7*n/19).

  • A057367: a(n) = floor(11*n/30).

  • A057427: a(n) = 1 if n > 0, a(n) = 0 if n = 0; series expansion of x/(1-x).

  • A057428: Sign(-n): a(n) = 1 if -n > 0, = -1 if -n < 0, = 0 if n = 0.

  • A057526: Number of applications of f to reduce n to 1, where f(k) is the integer among k/2,(k-1)/4, (k+1)/4.

  • A057527: 4th level factorials: product of first n superduperfactorials.

  • A057528: 5th level factorials: product of first n 4th level factorials.

  • A057544: Maximum cycle length (orbit size) in the rotation permutation of n+2 side polygon triangularizations.

  • A057566: Number of collinear triples in a 3 X n rectangular grid.

  • A057578: Maximal numbers of codewords in ternary code of length n with Hamming distance 3.

  • A057579: Maximal numbers of codewords in mixed code with 1 binary coordinate and n ternary coordinates with Hamming distance 3.

  • A057580: Maximal numbers of codewords in mixed code with 2 binary coordinates and n ternary coordinates with Hamming distance 3.

  • A057581: Maximal numbers of codewords in mixed code with 3 binary coordinates and n ternary coordinates with Hamming distance 3.

  • A057582: Maximal numbers of codewords in mixed code with 4 binary coordinates and n ternary coordinates with Hamming distance 3.

  • A057583: Maximal numbers of codewords in mixed code with 5 binary coordinates and n ternary coordinates with Hamming distance 3.

  • A057584: Maximal numbers of codewords in mixed code with 6 binary coordinates and n ternary coordinates with Hamming distance 3.

  • A057651: a(n) = (3*5^n - 1)/2.

  • A057681: a(n) = Sum_{j=0..floor(n/3)} (-1)^j*binomial(n,3*j).

  • A057682: a(n) = Sum_{j=0..floor(n/3)} (-1)^j*binomial(n,3*j+1).

  • A057706: Smaller of twin primes whose average is a primorial number.

  • A057711: a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.

  • A057717: The non-powers of 10.

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

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

  • A057726: Primes of the form 3^(2^n) + 2.

  • A057727: 3^(2^n) + 2.

  • A057736: Primes p such that 2^p + 3 is prime.

  • A057738: Primes p such that 3^p + 2 is prime.

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

  • A057769: a(n) = 4*n^4 + 8*n^3 - 4*n - 1 = (2*n^2 - 1)*(2*n^2 + 4*n + 1).

  • A057780: Multiples of 3 that are one less than a perfect square.

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

  • A057813: a(n) = (2*n+1)*(4*n^2+4*n+3)/3.

  • A057843: a(n) = floor(n*tau^2) - 3, where tau = (1+sqrt(5))/2.

  • A057861: floor[2^n/Fibonacci(n)].

  • A057862: a(n) = 2^n mod Fibonacci(n).

  • A057863: a(n) = Product_{k=1..n} (2k-1)!!.

  • A057932: a(n) = floor(10^(n+1)/81).

  • A057933: Floor[(80/81)*10^n].

  • A057960: Number of base-5 (n+1)-digit numbers starting with a zero and with adjacent digits differing by one or less.