Skip to content

Summary of block A079

81 sequences
  • A079001: Digital equivalents of letters A, B, C, …, Z on touch-tone telephone keypad.

  • A079003: Least k >= 3 such that Fibonacci(k) == -1 (mod 3^n).

  • A079027: a(n) = det(M(n)) where M(n) is the n X n matrix defined by m(i,i)=6, m(i,j)=i/j.

  • A079028: a(0) = 1, a(n) = (n + 4)*4^(n-1) for n >= 1.

  • A079097: Mix odd numbers and squares.

  • A079102: a(2n) = 2^n, a(2n+1) = 2^(2n).

  • A079236: Number of non-associative non-commutative anti-associative anti-commutative closed binary operations on a set of order n.

  • A079245: Number of isomorphism classes of associative commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.

  • A079260: Characteristic function of primes of form 4n+1 (1 if n is prime of form 4n+1, 0 otherwise).

  • A079261: Characteristic function of primes of form 4n+3 (1 if n is prime of form 4n+3, 0 otherwise).

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

  • A079273: Octo numbers (a polygonal sequence): a(n) = 5*n^2 - 6*n + 2 = (n-1)^2 + (2*n-1)^2.

  • A079282: Diagonal sums of triangle A055249.

  • A079283: Marks on lexicographically earliest 6-mark optimal Golomb ruler.

  • A079284: Diagonal sums of triangle A008949.

  • A079285: First differences of A079284.

  • A079288: a(n) = (3^n)!.

  • A079289: For even n, a(n) = a(n-2) + a(n-1) + 2^(n/2-2), n>2. For odd n, a(n) = a(n-2) + a(n-1).

  • A079291: Squares of Pell numbers.

  • A079309: a(n) = C(1,1) + C(3,2) + C(5,3) + … + C(2*n-1,n).

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

  • A079326: a(n) = the largest number m such that if m monominoes are removed from an n X n square then an L-tromino must remain.

  • A079333: Duplicate of A063938.

  • A079343: Period 6: repeat [0, 1, 1, 2, 3, 1]; also F(n) mod 4, where F(n) = A000045(n).

  • A079344: F(n) mod 8, where F(n) = A000045(n) is the n-th Fibonacci number.

  • A079345: Fibonacci(n) mod 16.

  • A079360: Sequence of sums of alternating increasing powers of 2.

  • A079362: Sequence of sums of alternating powers of 3.

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

  • A079429: a(0) = 2, a(1) = 3, a(2) = 5; a(n) = a(n-1) + [a(n-1)-a(n-2)] * [a(n-2)-a(n-3)].

  • A079444: Number of 3-cycles in range [A014137(2n+2)..A014138(2n+2)] of permutation A057505 (= Donaghey’s automorphism M).

  • A079472: Number of perfect matchings on an n X n L-shaped graph.

  • A079478: Coefficient of x^0 in P(n,x) = (Product_{i=0..n-1} i!^2)/matdet(M(n)) of degree n^2 where M(n) is the n X n matrix m(i,j) = 1/(i+j+x).

  • A079484: a(n) = (2n-1)!! * (2n+1)!!, where the double factorial is A006882.

  • A079496: a(0) = a(1) = 1; thereafter a(2*n+1) = 2*a(2*n) - a(2*n-1), a(2*n) = 4*a(2*n-1) - a(2*n-2).

  • A079498: Numbers whose sum of digits in base b gives 0 (mod b), for b = 3.

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

  • A079509: Duplicate of A000096.

  • A079511: a(n) = constant arising in game of n-times nim.

  • A079524: Expansion of (x + b*x^2 - b*x^3)/((1 - x^2)*(1 - x)^2) with b=2.

  • A079547: a(n) = ((n^6 - (n-1)^6) - (n^2 - (n-1)^2))/60.

  • A079556: a(1) = a(2) = 2; for n>2, a(n) = a(n-2)^a(n-1).

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

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

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

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

  • A079610: a(n) = (5*n+1)*(5*n+3)*(5*n+5).

  • A079613: a(n) = F(3*2^n) where F(k) denotes the k-th Fibonacci number.

  • A079622: Mersenne primes with prime “look and say” descriptions.

  • A079657: Fibonacci numbers using only the curved digits 0, 3, 6, 8 and 9.

  • A079658: Fibonacci numbers using only the straight digits 1, 4 and 7.

  • A079685: Degrees of irreducible representations of SL(2,5).

  • A079719: a(n) = n + floor(Sum_{k<n} a(k)/2) with a(0)=0.

  • A079731: Fundamental piano frequencies in Hertz rounded to nearest integer.

  • A079750: Operation count to create all permutations of n distinct elements using the “streamlined” version of Algorithm L (lexicographic permutation generation) from Knuth’s The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of comparisons required to find j in step L2.2’.

  • A079751: Operation count to create all permutations of n distinct elements using the “streamlined” version of Algorithm L (lexicographic permutation generation) from Knuth’s The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of cases where the j search loop runs beyond j=n-3.

  • A079752: Operation count to create all permutations of n distinct elements using the “streamlined” version of Algorithm L (lexicographic permutation generation) from Knuth’s The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times the search for an element exchangeable with a_j has to be started.

  • A079753: Operation count to create all permutations of n distinct elements using the “streamlined” version of Algorithm L (lexicographic permutation generation) from Knuth’s The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives total executions of step L3.1’.

  • A079754: Operation count to create all permutations of n distinct elements using the “streamlined” version of Algorithm L (lexicographic permutation generation) from Knuth’s The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3.1’.

  • A079755: Operation count to create all permutations of n distinct elements using the “streamlined” version of Knuth’s Algorithm L (lexicographic permutation generation).

  • A079756: Operation count to create all permutations of n distinct elements using the “streamlined” version of Algorithm L (lexicographic permutation generation) from Knuth’s The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of interchanges in reversal step.

  • A079757: Periodic sequence 1, 0, -2, 3, -2, 0, …

  • A079773: a(n) = 2*a(n-1)+15*a(n-2) with n>0, a(0)=0, a(1)=1.

  • A079813: n 0’s followed by n 1’s.

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

  • A079861: a(n) is the number of occurrences of 7’s in the palindromic compositions of 2*n-1, or also, the number of occurrences of 8’s in the palindromic compositions of 2*n.

  • A079862: a(i) = the number of occurrences of 9’s in the palindromic compositions of n=2*i-1 = the number of occurrences of 10’s in the palindromic compositions of n=2*i.

  • A079863: a(n) is the number of occurrences of 11s in the palindromic compositions of m=2*n-1 = the number of occurrences of 12s in the palindromic compositions of m=2*n.

  • A079878: a(1)=1, then a(n)=2*a(n-1) if 2*a(n-1)<=n, a(n)=2*a(n-1)-n otherwise.

  • A079899: a(1) = 1; a(n) = Fibonacci(n) - Fibonacci(n-1)* a(n-1) if n > 1.

  • A079903: a(n) = (9n^4 - 18n^3 + 18n^2 - 9n + 2)/2.

  • A079908: Solution to the Dancing School Problem with 3 girls and n+3 boys: f(3,n).

  • A079921: Solution to the Dancing School Problem with n girls and n+2 boys: f(n,2).

  • A079929: a(n)=(3*n+1)!/(n!*3^n).

  • A079935: a(n) = 4*a(n-1) - a(n-2) with a(1) = 1, a(2) = 3.

  • A079946: Numbers k whose binary expansion begins with two or more 1’s and ends with at least one 0.

  • A079962: Number of permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i=1..n, with k=1, r=5, I={1,3}.

  • A079977: Fibonacci numbers interspersed with zeros.

  • A079978: Characteristic function of multiples of three.

  • A079979: Characteristic function of multiples of six.

  • A079998: The characteristic function of the multiples of five.