Skip to content

Summary of block A075

41 sequences
  • A075091: Sum of Lucas numbers and reflected Lucas numbers (comment to A061084).

  • A075100: Number of words of length strictly between 1 and n that are needed on the way to computing all words of length n in the free monoid with two generators.

  • A075118: Variant on Lucas numbers: a(n) = a(n-1) + 3*a(n-2) with a(0)=2 and a(1)=1.

  • A075123: a(n) is the least positive integer > a(n-1) and a(n) is not 2*a(i)+a(j) for 1<=i<j<n.

  • A075150: a(n) = L(n)*C(n), L(n)=Lucas numbers (A000032), C(n)=reflected Lucas numbers (see comment to A061084).

  • A075193: Expansion of (1-2*x)/(1+x-x^2).

  • A075269: Product of Lucas numbers and inverted Lucas numbers: a(n)=A000032(n)*A075193(n).

  • A075317: Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),… This is the sequence of the first member of pairs.

  • A075318: Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),… This is the sequence of the second member of pairs.

  • A075319: Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),… This is the sequence of the sum of the members of pairs.

  • A075328: Difference between n-th pair in A075325.

  • A075411: Squares of A002276.

  • A075412: Squares of A002277.

  • A075413: Squares of A002278.

  • A075414: Squares of A002279: a(n) = (5*(10^n - 1)/9)^2.

  • A075415: Squares of A002280 or numbers (666…6)^2.

  • A075416: Squares of A002281.

  • A075417: Squares of A002282: a(n) = (8*(10^n - 1)/9)^2.

  • A075441: a(n) is the number of solutions to the n-term Znám problem.

  • A075528: Triangular numbers that are half other triangular numbers.

  • A075550: Irredundance number for kings graph K(n).

  • A075561: Domination number for kings’ graph K(n).

  • A075677: Reduced Collatz function R applied to the odd integers: a(n) = R(2n-1), where R(k) = (3k+1)/2^r, with r as large as possible.

  • A075692: Upper irredundance number for queens graph Q_n on n^2 nodes.

  • A075727: a(n) = 2 Pi * n rounded off.

  • A075796: Numbers k such that 5*k^2 + 5 is a square.

  • A075835: Numbers k such that 13*k^2 + 4 is a square.

  • A075839: Numbers k such that 11*k^2 - 2 is a square.

  • A075841: Numbers k such that 2*k^2 - 9 is a square.

  • A075843: Numbers k such that 99*k^2 + 1 is a square.

  • A075848: Numbers k such that 2*k^2 + 9 is a square.

  • A075849: a(1) = a(2) = 1; a(n) = a(n-1)! + a(n-2) for n > 2.

  • A075855: Maximum number of black squares on an n X n chessboard (with a black square in at least one corner) that can be covered by a single path, traveling only to adjacent black squares.

  • A075858: n followed by n 1’s.

  • A075869: Numbers k such that 5*k^2 - 9 is a square.

  • A075870: Numbers k such that 2*k^2 - 4 is a square.

  • A075871: Numbers k such that 13*k^2 + 1 is a square.

  • A075878: Sum of coefficients of (x1)^(2i(1))*(x2)^(2i(2))*(x3)^(2i(3))*(x4)^(2i(4)) for {(i1),(i2),(i3),(i4)}=0,1,2,… : sum(i)=2n in the expansion of (x1+x2+x3+x4)^(2n) where n >= 1.

  • A075883: a(1) = a(2) = 1; a(n) = a(n-1) + a(n-2)! for n > 2.

  • A075897: 1 if binary weight of n is 1 or 2, otherwise 0.

  • A075921: Second column of triangle A075502.