Skip to content

Summary of block A181

55 sequences
  • A181020: Maximum number of 1s in an nX(n+1) binary matrix with no three 1s adjacent in a line along a row, column or diagonally.

  • A181025: Maximum number of 1s in an nX(n+1) binary matrix with no four 1s adjacent in a line along a row, column or diagonally.

  • A181026: Maximum number of 1s in an nX(n+2) binary matrix with no four 1s adjacent in a line along a row, column or diagonally.

  • A181106: Largest odd number strictly less than a square.

  • A181133: a(n) = n + A003056(n).

  • A181155: Odious numbers (A000069) plus one; complement of A026147.

  • A181156: Odd Fibonacci numbers F which have a proper Fibonacci divisor G such that F/G is a Lucas number or a product of Lucas numbers.

  • A181170: Number of connected 9-regular simple graphs on 2n vertices with girth at least 4.

  • A181174: The “Row2” sums of the powers-of-2 triangle A000079.

  • A181175: The “Fi1” sums of the powers-of-2 triangle A000079.

  • A181179: a(1)=1; for n>=2, a(n) = 2*a(n-1)!.

  • A181192: Number of n X 5 matrices containing a permutation of 1..n*5 in increasing order rowwise, columnwise, diagonally and (downwards) antidiagonally.

  • A181278: Number of 2 X n binary matrices M with rows in strictly increasing order and rows of M*Mtranspose (mod 2) in strictly decreasing order.

  • A181281: A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,…,n in a circle, increasing clockwise. Starting with i=1, delete the integer 4 places clockwise from i. Repeat, counting 4 places from the next undeleted integer, until only one integer remains.

  • A181282: a(n) is the number of associate Rota-Baxter words in one idempotent generator x and one idempotent operator P of degree n. Such words are Rota-Baxter words that begin and/or end with x, and P is applied n times in the word.

  • A181286: Partial sums of floor(n^2/3) (A000212).

  • A181287: Numbers of the form i*5^j-1 (i=1..4, j >= 0).

  • A181288: Numbers of the form i*6^j-1 (i=1..5, j >= 0).

  • A181292: The sum of the entries in the top rows of all 2-compositions of n. A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.

  • A181353: a(n) = 9*a(n-1) + 3*a(n-2); a(0) = 0, a(1) = 1.

  • A181358: Number of twiddle factors in the first stage of a Pease Radix 4 Fast Fourier Transform.

  • A181367: Number of 2-compositions of n containing at least one 0 entry. A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.

  • A181385: Maximal number that can be obtained by reversing n in an integer base.

  • A181388: a(n) = Sum_{k=1..n} 2^T(k-1), where T = A000217 are the triangular numbers 0, 1, 3, 6, 10, … . For n=0 we have the empty sum equal to 0.

  • A181390: Absolute difference between (sum of previous terms) and (n-th-odd square) with a(1) = 1.

  • A181404: Total number of positive integers below 10^n requiring 8 positive cubes in their representation as sum of cubes.

  • A181427: a(n) = n + [n^2 if n is odd or n^3 if n is even].

  • A181440: a(1) = 2; for n > 1, a(n) = A000217(n)-(sum of previous terms).

  • A181447: Numbers k such that 3 is the largest prime factor of k^2 - 1.

  • A181475: a(n) = 3*n^4 + 6*n^3 - 3*n + 1.

  • A181490: Numbers k such that 3*2^k-1 and 3*2^k+1 are twin primes (A001097).

  • A181491: Primes of the form p = 3*2^k - 1 such that p+2 is also prime.

  • A181493: Numbers of the form 3*2^k which are the average of twin primes, i.e., a(n)-1 and a(n)+1 are both prime.

  • A181510: Number of permutations of the multiset {1,1,2,2,3,3,…,n+1,n+1} avoiding the permutation patterns {132, 231, 2134}.

  • A181527: Binomial transform of A113127; (1, 1, 3, 7, 15, 31, …) convolved with (1, 3, 7, 15, 31, 63, …).

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

  • A181569: Greatest common divisor of n! and n+1.

  • A181617: Molecular topological indices of the complete graph K_n.

  • A181640: Partial sums of floor(n^2/5) (A118015).

  • A181679: a(n) = 121*n^2 + 2*n.

  • A181685: Expansion of 36*x^2*(1+6*x-36*x^2) / ( (1-6*x)^2 *(1+6*x+36*x^2) ).

  • A181716: a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.

  • A181718: a(n) = (1/9)*(10^(2*n) + 10^n - 2).

  • A181745: Prime numbers that are factorial differences p! -q! where p+1 and q+1 are both prime numbers.

  • A181762: a(n) = n/2 if n is even, otherwise 3n+5.

  • A181773: Molecular topological indices of the cocktail party graphs.

  • A181863: Decimal sturdy primes: primes p such that sum of digits of k*p for any positive integer k is at least the sum of digits of p.

  • A181890: a(n) = 8*n^2 + 14*n + 5.

  • A181900: a(n) = n * A022998(n).

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

  • A181968: a(n) = 54n^3 - 1.

  • A181975: The sequence {1, 2, 3, 4, 5, 4, 3, 2} repeated.

  • A181982: Expansion of (1 - x^2)^2 * (1 + x)^2 / (1 - x^6) in powers of x.

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

  • A181995: a(n) = if n mod 2 = 1 then n*(n - 1) else (n - 1)^2 + (n - 2)/2.