Skip to content

Summary of block A261

39 sequences
  • A261033: Values of n such that A002110(n) - A007504(n) - 1 is a prime number.

  • A261039: Numbers n that begin a sequence of 100 consecutive integers (n, n+1, …, n+99) containing at least 25 primes.

  • A261040: Values of c such that the Diophantine equation 5*a + 3*b = c has no solutions in positive integers.

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

  • A261071: a(n) = 2^(n!) + 1.

  • A261120: The number of distinct triple points in the set of function values FLSN(m/6/7^n), m in 0, 1, 2… 6*7^n, where FLSN:[0,1] is the “flowsnake” plane filling curve.

  • A261143: a(n) = H_n(1,2) where H_n is the n-th hyperoperator.

  • A261191: 40-gonal numbers: a(n) = 38*n*(n-1)/2 + n.

  • A261193: a(n) = n! - 2.

  • A261243: Row lengths of the irregular triangles A258643 and A261242: maximal number of 0-islands (holes) of certain bisymmetric n X n matrices with 0 or 1 entries only.

  • A261276: 100-gonal numbers: a(n) = 98*n*(n-1)/2 + n.

  • A261343: 50-gonal numbers: a(n) = 48*n*(n-1)/2 + n.

  • A261348: a(1)=0; a(2)=0; for n>2: a(n) = A237591(n,2) = A237593(n,2).

  • A261391: a(n) = n^5 + 5*n^3 + 5*n.

  • A261397: a(n) = 3^n*Fibonacci(n).

  • A261399: a(1)=1; thereafter a(n) = (2/5)*(9*6^(n-2)+1).

  • A261471: Cyclotomic polynomial value Phi(6,n!).

  • A261491: a(n) = ceiling(2 + sqrt(8*n-4)).

  • A261521: a(n) = n^2 + 2*n + 29.

  • A261544: a(n) = Sum_{k=0..n} 1000^k.

  • A261547: The 3 X 3 X … X 3 dots problem (3, n times): minimal number of straight lines (connected at their endpoints) required to pass through 3^n dots arranged in a 3 X 3 X … X 3 grid.

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

  • A261574: a(n) = n*(n^2 + 3)*(n^6 + 6*n^4 + 9*n^2 + 3).

  • A261606: a(n) = Fibonacci(n) mod 60.

  • A261667: Dimension of a certain space of duality relations arising in study of q-analogs of multiple zeta values.

  • A261671: If n even, a(n) = 6n+3, otherwise a(n) = n.

  • A261693: Irregular triangle read by rows in which row n lists the positive odd numbers in decreasing order starting with 2^n - 1. T(0, 1) = 0 and T(n, k) for n >= 1, 1 <= k <= 2^(n-1).

  • A261694: a(n) = Fibonacci(n) mod 21.

  • A261714: Numbers n such that n! + 2^n + 1 is prime.

  • A261716: Odd numbers that result in a prime when their cubes are concatenated with the cubes of all smaller odd numbers in descending order.

  • A261722: Values of m such that 2^m + 3^m + 5^m + 7^m + 11^m + 13^m is a prime number.

  • A261723: Interleave 2^n + 2 and 2^n + 1.

  • A261766: a(n) is the number of partial derangements of an n-set with at least one orbit of size exactly n.

  • A261779: a(n) = ceiling((n-1)! / n).

  • A261864: Number of reversible one-dimensional cellular automaton rules with 2 colors and n neighbors.

  • A261893: a(n) = (n+1)^3 - n^2.

  • A261898: Values of |G-hat_1(n)|, a sum involving Stirling numbers of the second kind.

  • A261953: Start with a single equilateral triangle for n=0; for the odd n-th generation add a triangle at each expandable side of the triangles of the (n-1)-th generation (this is the “side to side” version); for the even n-th generation use the “vertex to vertex” version; a(n) is the number of triangles added in the n-th generation.

  • A261972: The first of three consecutive positive integers the sum of the squares of which is equal to the sum of the squares of four consecutive positive integers.