Skip to content

Summary of block A179

70 sequences
  • A179001: Partial sums of floor(Fibonacci(n)/3).

  • A179006: Partial sums of floor(Fibonacci(n)/4).

  • A179018: Partial sums of ceiling(Fibonacci(n)/2).

  • A179020: Doubled Thue-Morse sequence: the A010059 sequence replacing 0 with 0,0 and 1 with 1,1.

  • A179023: a(n) = n(F(n+2) - 1) where F(n) is defined by A000045.

  • A179041: Partial sums of ceiling(Fibonacci(n)/3).

  • A179042: Partial sums of ceiling(Fibonacci(n)/4).

  • A179054: a(n) = (1^k + 2^k + … + n^k) modulo (n+2), where k is any odd integer greater than or equal to 3.

  • A179056: Numbers k such that prime(1)^1 + prime(2)^2 + … + prime(k)^k is prime.

  • A179058: Number of non-attacking placements of 3 rooks on an n X n board.

  • A179081: Parity of sum of digits of n.

  • A179090: Variant of Sylvester’s sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 14.

  • A179091: Variant of Sylvester’s sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 15.

  • A179092: Variant of Sylvester’s sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 16.

  • A179093: Variant of Sylvester’s sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 17.

  • A179095: Rectified 5-cell numbers: the coefficient of x^{2n-2} in (1+x+x^2+ … + x^{n-1})^5.

  • A179101: Numbers which are not the sum of exactly one positive square and a sum of squares-minus-1.

  • A179121: Variant of Sylvester’s sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 18.

  • A179135: a(n) = (3-sqrt(5))*((3+sqrt(5))/10)^(-n)/2+(3+sqrt(5))*((3-sqrt(5))/10)^(-n)/2.

  • A179167: Place a(n) red and b(n) blue balls in an urn; draw 3 balls without replacement; Probability(3 red balls) = Probability(1 red and 2 blue balls); binomial(a(n),3) = binomial(a(n),1)*binomial(b(n),2).

  • A179172: Numbers n such that Mordell’s equation y^2 = x^3 - n has exactly 16 integral solutions.

  • A179177: Integral exponents n for radial potentials V=a*r^(n+1) that lead to motions in terms of circular functions and Legendre Elliptic Integrals.

  • A179183: The size of an optimal binary code of length n and edit distance 3.

  • A179184: Number of connected 2-regular simple graphs with n vertices.

  • A179207: a(n) = n - 1 + ceiling((-3 + n^2)/2) if n > 1 with a(1)=1, complement of A182835.

  • A179237: a(0) = 1, a(1) = 2; a(n+1) = 6*a(n) + a(n-1) for n>1.

  • A179241: Powers of sqrt(5) - 1 rounded down.

  • A179259: Arises in covering a graph by forests and a matching.

  • A179268: Product of numbers between and including n and n^2.

  • A179272: Sharp upper bound on Rosgen overlap number n-vertex graph with n >= 14, formula abused here for nonnegative integers.

  • A179278: Largest nonprime integer <= n.

  • A179297: a(n) = n^2 - (n-1)^2 - (n-2)^2 - … - 1^2.

  • A179436: a(n) = (3*n+7)*(3*n+2)/2.

  • A179442: a(n) = ((n-1)! * (n+1)!) / n.

  • A179477: Antonym of A014824: each term is 10 times the previous term minus n.

  • A179508: a(n) is the unique integer such that Sum_{k=0..p-1} b(k)/(-n)^k == a(n) (mod p) for any prime p not dividing n, where b(0), b(1), b(2), … are Bell numbers given by A000110.

  • A179526: (3^k - 1)/2 appears 3^(k-1) times, k>0.

  • A179532: a(n) = 2^ceiling(n*(n+1)/3).

  • A179555: a(1)=10; a(n) = a(n-1)*10 - 1.

  • A179598: Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + 2*x)/(1 - 3*x - 8*x^2).

  • A179599: Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + 4*x)/(1 - 3*x - 8*x^2).

  • A179602: Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + 2*x)/(1 - 3*x - 7*x^2).

  • A179603: Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + 3*x)/(1 - 3*x - 7*x^2).

  • A179604: Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + x)/(1 - 2*x - 9*x^2 - 2*x^3).

  • A179606: Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + x)/(1 - 3*x - 5*x^2).

  • A179607: Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + 2*x - 4*x^2)/(1 - 2*x - 8*x^2).

  • A179608: a(n) = (7 + (-1)^n + 6*n)*2^(n-3).

  • A179609: a(n)=(5-(-1)^n-6*n)*2^(n-2).

  • A179610: Eight white kings and one red king on a 3 X 3 chessboard. G.f.: 1/(1-3*x-5*x^2+4*x^3).

  • A179619: a(1)=1, a(n+1) = 10*a(n)+2*n-1.

  • A179739: a(n) = 2*h(n)-1 where h(n) is the sequence of records positions of A179738.

  • A179741: a(n) = (2*n+1)*(6*n-1).

  • A179742: The number of syllables in each letter of the English alphabet.

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

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

  • A179805: a(0) = 1, a(1) = 3, a(2) = 6 and a(n) = 2*a(n-1) - a(n-2) for n > 3.

  • A179819: Monetary amounts in U.S. cents such that the smallest number of coins summing to the amount uses only denominations of 10 cents and above.

  • A179820: a(n) = n-th triangular number mod (n+2).

  • A179823: Denominators in the approximation of sqrt(2) satisfying the recurrence: a(n)= [a(n-1)*a(n-2)+2]/[a(n-1)+a(n-2)] with a(1)=a(2)=1.

  • A179824: Chromatic polynomial of the star graph on 4 vertices (claw graph) and the path graph on 4 vertices.

  • A179865: Number of n-bit binary numbers containing one run of 0’s.

  • A179868: (Number of 1’s in the binary expansion of n) mod 4.

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

  • A179894: Given the series (1, 2, 1, 2, 1, 2, …), let (1 + 2x + x^2 + 2x^3 + …) * (1 + 2x^2 + x^3 + 2x^4 + …) = (1 + 2x + 3x^2 + 7x^3 + …)

  • A179903: (1, 3, 5, 7, 9, …) convolved with (1, 0, 3, 5, 7, 9, …).

  • A179904: a(n) = A056520(n)+1 for n>0, a(0)=1.

  • A179907: Numerators in the approximation of sqrt(2) satisfying the recurrence: a(n)= [a(n-1)*a(n-2)+2]/[a(n-1)+a(n-2)] with a(1)=a(2)=1.

  • A179976: a(n) = 2^(2n+1) mod (2n+1).

  • A179986: Second 9-gonal (or nonagonal) numbers: a(n) = n*(7*n+5)/2.

  • A179991: Nonhomogeneous three-term sequence a(n) = a(n-1) + a(n-2) + n.