Skip to content

Summary of block A175

80 sequences
  • A175001: Number of stable n-celled patterns (“still lifes”) in the Move (a.k.a. Morley; B368/S245) cellular automaton.

  • A175028: a(n)=n+1 if n is prime, otherwise a(n)=n-1.

  • A175029: a(n)=2*n if n is prime, otherwise a(n)=3*n.

  • A175030: a(n)=3*n if n is prime, otherwise a(n)=2*n.

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

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

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

  • A175113: a(n) = ((2*n + 1)^6 + 1)/2.

  • A175151: a(n) = Sum_{i=1..n} ((i+1)^i - 1)/i.

  • A175161: a(n) = 8*(2^n + 1).

  • A175162: a(n) = 16*(2^n + 1).

  • A175163: a(n) = 32*(2^n + 1).

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

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

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

  • A175169: Numbers k that divide the sum of digits of 2^k.

  • A175172: Primes p such that 3*2^p+1 is also prime.

  • A175234: Primes p such that 2^p+15 is also prime.

  • A175237: 2*(10^n - 7).

  • A175287: Partial sums of ceiling(n^2/4).

  • A175395: a(n) = 2*Fibonacci(n)^2.

  • A175403: a(n) is the smallest number m requiring n iterations {((((D_1^D_2)^D_3)^D_4)^…)^D_k to reach a one-digit number starting at r = n, where D_k is the k-th digit D of the number r and k is the digit number of the number r in the decimal expansion of r (A055642)}.

  • A175406: The greatest integer k such that (1+1/n)^k <= 2.

  • A175409: Successive numbers of consecutive positive terms to add when rearranging the alternating harmonic series to sum to log[7/3].

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

  • A175558: a(n) = 167^n.

  • A175567: (n!)^2 modulo n(n+1)/2.

  • A175601: 7*(10^n-9).

  • A175602: 8*(10^n-3).

  • A175603: a(n) = 8*(10^n-5).

  • A175604: a(n) = 8*(10^n-7).

  • A175629: Legendre symbol (n,7).

  • A175630: a(n) = n-th pentagonal number mod (n+2).

  • A175631: a(n) = (n-th pentagonal number) modulo (n-th triangular number).

  • A175654: Eight bishops and one elephant on a 3 X 3 chessboard. G.f.: (1 - x - x^2)/(1 - 3*x - x^2 + 6*x^3).

  • A175655: Eight bishops and one elephant on a 3 X 3 chessboard. G.f.: (1+x-5*x^2)/(1-3*x-x^2+6*x^3).

  • A175656: Eight bishops and one elephant on a 3 X 3 chessboard. G.f.: (1-3*x^2)/(1-3*x+4*x^3).

  • A175657: Eight bishops and one elephant on a 3 X 3 chessboard: a(n) = 3*2^n - 2*F(n+1), with F(n) = A000045(n).

  • A175658: Eight bishops and one elephant on a 3 X 3 chessboard: a(n) = 2*Pell(n+1)+2*Pell(n)-2^n, with Pell = A000129.

  • A175659: Eight bishops and one elephant on a 3 X 3 chessboard: a(n)= (3^(n+1)-Jacobsthal(n+1))-(3^n-Jacobsthal(n)), with Jacobsthal=A001045.

  • A175660: Eight bishops and one elephant on a 3 X 3 chessboard. a(n) = 2^(n+2) - 3*F(n+2).

  • A175661: Eight bishops and one elephant on a 3 X 3 chessboard: a(n) = 2^(n+2)-3*F(n+1), with F(n) = A000045(n).

  • A175673: Number of n-digit terms in A179955.

  • A175676: a(n) = binomial(n,3) mod n.

  • A175677: Binomial(n,4) mod n.

  • A175718: Duplicate of A173603.

  • A175719: a(1) = 1, for n >= 2, a(n) = the smallest number m with (a(n-1) + 3) divisors.

  • A175774: 7*(10^n-5).

  • A175775: 7*(10^n-3).

  • A175777: Partial sums of floor(n^2/16).

  • A175796: H_n(n, 2) where H_c(a, b) is the hyperoperation function with operator c.

  • A175805: a(n) = 21*2^n.

  • A175806: a(n) = 27*2^n.

  • A175824: Maximum unsigned integer that can be stored in n bytes.

  • A175825: Maximum signed integer that can be stored in n bytes.

  • A175826: Partial sums of ceiling(n^2/8).

  • A175827: Partial sums of ceiling(n^2/10).

  • A175828: a(n) = (n*(6*n+1)+(n+2)*(-1)^n)/2.

  • A175831: Partial sums of ceiling(n^2/12).

  • A175833: Periodic sequence: repeat 4,7,11.

  • A175848: Partial sums of ceiling(n^2/16).

  • A175884: Numbers that are congruent to {0, 2, 4, 7, 9} mod 12.

  • A175885: Numbers that are congruent to {1, 10} mod 11.

  • A175886: Numbers that are congruent to {1, 12} mod 13.

  • A175887: Numbers that are congruent to {1, 14} mod 15.

  • A175921: Period 5: repeat [1, 2, 2, -1, 1].

  • A175922: Period 5: repeat [1, 1, 2, -1, 2].

  • A175925: a(n) = (2*n+1)*(n+1)!.

  • A175952: The generations in which the transformation described in A072207 does not lead to a doubling of the cardinality of the set of rationals.

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

  • A175977: a(1) = 1, for n >= 2: a(n) = (n-1)^a(n-1) + 1.

  • A175978: a(1) = 1, for n >= 2: a(n) = a(n-1)^(n-1) + 1.

  • A175979: a(1) = 1, for n >= 2: a(n) = n^a(n-1) + 1.

  • A175980: a(1) = 1, for n >= 2: a(n) = a(n-1)^n + 1.

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

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

  • A175984: a(1) = 1, for n >= 2: a(n) = (a(n-1)+1)^(n-1) + 1.

  • A175985: a(1) = 1, for n >= 2: a(n) = (a(n-1)+1)^(n-1) - 1.

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

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