Skip to content

Summary of block A094

132 sequences
  • A094002: a(n+3) = 3*a(n+2) - 2*a(n+1) + 1 with a(0)=1, a(1)=5.

  • A094003: a(1) = 2, a(n+1) = (a(n)^(n+1) - 1)/(a(n) - 1).

  • A094012: Expansion of x*(1-6*x+10*x^2)/(1-4*x+2*x^2)^2.

  • A094013: Expansion of (1-4*x)/(1-4*x-4*x^2).

  • A094014: Expansion of (1-2*x)/(1-8*x^2).

  • A094015: Expansion of (1+4*x)/(1-8*x^2).

  • A094024: Alternating 1 with one less than the powers of 2.

  • A094028: Expansion of 1/((1-x)*(1-100*x)).

  • A094033: Number of connected 2-element antichains on a labeled n-set.

  • A094039: Binomial transform of (Jacobsthal(n) + 2^n*Jacobsthal(-n))/2.

  • A094041: Beatty sequence for e^Pi - Pi^e - i^i.

  • A094042: Beatty sequence for e^Pi - Pi^e - i^i.

  • A094055: Duplicate of A094056.

  • A094081: Smallest integral ladder whose ends slide over the respective distances 1 and m=2*n+1 while slipping down along horizontal ground and vertical wall against which it leans.

  • A094091: a(1) = 0; for n>0, a(n) = smaller of 0 and 1 such that we avoid the property that, for some i and j in the range S = 2 <= i < j <= n/2, a(i) … a(2i) is a subsequence of a(j) … a(2j).

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

  • A094159: 3 times hexagonal numbers: a(n) = 3*n*(2*n-1).

  • A094177: Sequence from an aptitude test that I cannot work out!

  • A094195: Expansion of g.f.: (1-4*x)/((1-5*x)*(1-x)^2).

  • A094200: a(n) = 16*n^4 + 32*n^3 + 36*n^2 + 20*n + 3.

  • A094225: Number of distinct n-row absolute difference tables that consist entirely of the first A000217(n) natural numbers.

  • A094258: a(1) = 1, a(n+1) = n*n! for n >= 1.

  • A094259: Expansion of g.f.: (1-5*x)/((1-6*x)*(1-x)^2).

  • A094283: Row sums of triangle A094280.

  • A094284: a(n) = A094283(n+1)/A094283(n).

  • A094292: Number of (s(0), s(1), …, s(n)) such that 0 < s(i) < 5 and |s(i) - s(i-1)| <= 1 for i = 1,2,…,n, s(0) = 2, s(n) = 4.

  • A094294: a(n) = n*a(n-1) - n + 2 for n > 1; a(1)=1.

  • A094297: Number of (s(0), s(1), …, s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,…,n, s(0) = 2, s(n) = 2.

  • A094303: a(1) = 1, a(2) = 2, and a(n+1) = a(n) * sum of all previous terms up to a(n-1) for n >= 2.

  • A094304: Sum of all possible sums formed from all but one of the previous terms, starting 1.

  • A094306: Number of (s(0), s(1), …, s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,…,n, s(0) = 2, s(n) = 4.

  • A094309: Number of (s(0), s(1), …, s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,…,n, s(0) = 2, s(n) = 5.

  • A094347: a(n) = 14*a(n-1) - a(n-2); a(0) = a(1) = 2.

  • A094359: Pair reversal of a Jacobsthal sequence.

  • A094360: Pair reversal of Jacobsthal-Lucas numbers.

  • A094361: Pair-reversal of 1,4,4,16,16…

  • A094364: Expansion of (1-5x)/(1-10x-100x^2).

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

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

  • A094375: a(n) = (4^n - 2^n)/2 + 3^n.

  • A094388: Expansion of (1- 2*x - x^2)/((1-x)*(1-3*x)).

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

  • A094432: a(n) = rightmost term in M^n * [1 0 0]. M = the 3 X 3 stiffness matrix [1 -1 0 / -1 4 -3 / 0 -3 3].

  • A094434: a(n) = rightmost term of M^n * [1 0 0], with M = the 3 X 3 matrix [1 -1 0 / -1 3 -2 / 0 -2 2].

  • A094445: Values of m satisfying Euler’s rule.

  • A094446: Values of n satisfying Euler’s rule.

  • A094475: Primes of form 2^n + 5^n.

  • A094500: Least number k such that (n+1)^k / n^k >= 2.

  • A094505: Powers of 2 which are not the sum of divisors of any other number. Powers of 2 present in A007369.

  • A094554: Number of closed walks of length n at a base vertex of a truncated tetrahedron (triangular prism).

  • A094555: Number of walks of length n between two vertices on the same triangular face of a truncated tetrahedron (triangular prism).

  • A094567: Associated with alternating row sums of array in A094566.

  • A094569: Associated with alternating row sums of array in A094568.

  • A094584: Dot product of (1,2,…,n) and first n distinct Fibonacci numbers.

  • A094586: Central numbers of the triangle T of all positive differences of distinct Fibonacci numbers.

  • A094588: a(n) = n*F(n-1) + F(n), where F = A000045.

  • A094616: Row sums of A094615.

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

  • A094623: Expansion of g.f. x*(1+10*x)/((1-x)*(1-10*x^2)).

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

  • A094632: A trace sequence for a Napoleon graph.

  • A094633: A Lucas Jacobsthal product.

  • A094680: a(n+1) = 4*a(n)^3 - 3*a(n), with a(0) = 2.

  • A094686: A Fibonacci convolution.

  • A094687: Convolution of Fibonacci and Jacobsthal numbers.

  • A094688: Convolution of Fibonacci(n) and 3^n.

  • A094696: Records in A007321.

  • A094697: Where records occur in A007321.

  • A094705: Convolution of Jacobsthal(n) and 3^n.

  • A094706: Convolution of Pell(n) and 2^n.

  • A094707: Partial sums of repeated Fibonacci sequence.

  • A094723: a(n) = Pell(n+2) - 2^n.

  • A094726: Let M = the 2 X 2 matrix [ 0 3 / 3 2]. Take (M^n * [1 1])/3 = [p q]; then a(n) = p.

  • A094727: Triangle read by rows: T(n,k) = n + k, 0 <= k < n, n >= 1.

  • A094729: Number of connected ordered 2-element multiantichains on a labeled n-set.

  • A094734: Number of connected 2-element multiantichains on a labeled n-set.

  • A094760: Duplicate of A083956.

  • A094761: a(n) = n + (square excess of n).

  • A094792: a(n) = (1/n!)*A001565(n).

  • A094793: a(n) = (1/n!)*A001688(n).

  • A094797: Number of times 1 is used in writing out all numbers 1 through 10^n.

  • A094803: Number of (s(0), s(1), …, s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,…,2n, s(0) = 1, s(2n) = 3.

  • A094806: Number of (s(0), s(1), …, s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,…,2n, s(0) = 1, s(2n) = 5.

  • A094811: Number of (s(0), s(1), …, s(2n+1)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,…,2n+1, s(0) = 1, s(2n+1) = 6.

  • A094817: Number of (s(0), s(1), …, s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,…,2n, s(0) = 3, s(2n) = 3.

  • A094821: Number of (s(0), s(1), …, s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,…,2n, s(0) = 3, s(2n) = 5.

  • A094823: If n = c0 + c1*10 + c2*10^2 + …cn*10^n then a(n) = c0 + c1*13 + c2*13^2 + …cn*13^k.

  • A094859: Maximal number of longest common subsequences between any two ternary strings of length n (Version 2).

  • A094867: Number of iterations of the LQTL cellular automaton required to generate a square of cells in identical states.

  • A094875: a(n)=1 if floor(Pi*10^n) is prime, otherwise a(n)=0.

  • A094918: a(n) = (3^n-1)/2 mod n.

  • A094919: a(n) = (4^n-1)/3 mod n.

  • A094920: a(n) = (5^n-1)/4 mod n.

  • A094921: a(n) = (6^n-1)/5 mod n.

  • A094922: a(n) = (7^n-1)/6 mod n.

  • A094923: (8^n-1)/7 mod n.

  • A094924: a(n) = (9^n-1)/8 mod n.

  • A094938: a(n)=(-36^n/18)*B(2n,1/6)/B(2n,1/3) where B(n,x) is the n-th Bernoulli polynomial.

  • A094941: a(n) is n! times the coefficient of Pi^floor(n/2) in the volume of an n-dimensional unit ball.

  • A094952: A sequence derived from pentagonal numbers, or a Stirling number of the first kind matrix.

  • A094958: Numbers of the form 2^k or 5*2^k.

  • A094966: Left-hand neighbors of Fibonacci numbers in Stern’s diatomic series.

  • A094967: Right-hand neighbors of Fibonacci numbers in Stern’s diatomic series.

  • A094968: Indices of Fibonacci numbers in Stern’s diatomic series A049456 regarded as a single linear sequence.

  • A094969: a(n) = floor(5^n/2^n).

  • A094970: a(n) = floor(7^n/2^n).

  • A094971: a(n) = floor(9^n/2^n).

  • A094972: a(n) = floor(11^n/2^n).

  • A094974: a(n) = floor(5^n/3^n).

  • A094975: a(n) = floor(7^n/3^n).

  • A094976: a(n) = floor(8^n/3^n).

  • A094977: a(n) = floor(10^n/3^n).

  • A094978: a(n) = floor(11^n/3^n).

  • A094979: Duplicate of A065565.

  • A094980: a(n) = floor(7^n/4^n).

  • A094981: a(n) = floor(9^n/4^n).

  • A094982: a(n) = floor(11^n/4^n).

  • A094983: a(n) = floor(6^n/5^n).

  • A094984: a(n) = floor(7^n/5^n).

  • A094985: a(n) = floor(8^n/5^n).

  • A094986: a(n) = floor(9^n/5^n).

  • A094987: a(n) = floor(11^n/5^n).

  • A094988: a(n) = floor(7^n/6^n).

  • A094989: Floor(11^n/6^n).

  • A094990: a(n) = floor(8^n/7^n).

  • A094991: a(n) = floor(9^n/7^n).

  • A094992: a(n) = floor(10^n/7^n).

  • A094993: a(n) = floor(11^n/7^n).

  • A094994: a(n) = floor(9^n/8^n).

  • A094995: a(n) = floor(11^n/8^n).

  • A094996: a(n) = floor(10^n/9^n).

  • A094997: a(n) = floor(11^n/9^n).