Skip to content

Summary of block A134

120 sequences
  • A134006: a(n) = 1^n + 3^n + 5^n + 7^n.

  • A134018: Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which either x is a subset of y or y is a subset of x, or 1) x and y are intersecting but for which x is not a subset of y and y is not a subset of x.

  • A134021: Length of n in balanced ternary representation.

  • A134057: a(n) = binomial(2^n-1,2).

  • A134062: Row sums of triangle A134061.

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

  • A134064: Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are intersecting but for which x is not a subset of y and y is not a subset of x, or 1) x and y are intersecting and for which either x is a proper subset of y or y is a proper subset of x, or 2) x = y.

  • A134067: Row sums of triangle A134066.

  • A134119: a(n) = floor(n^2/10) - floor((n-1)^2/10).

  • A134142: List of quadruples: 2*(-4)^n, -3*(-4)^n, 2*(-4^n), 2*(-4)^n, n >= 0.

  • A134153: a(n) = 15*n^2 + 9*n + 1.

  • A134154: a(n) = 15*n^2 - 9*n + 1.

  • A134158: a(n) = 1 + 27n + 252n^2 + 882n^3 + 1029n^4.

  • A134163: 1 + 12*n + 81*n^3 + n*(105*n + 81*n^3)/2.

  • A134165: Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which either x is a subset of y or y is a subset of x, or 1) x and y are disjoint and for which x is not a subset of y and y is not a subset of x, or 2) x and y are intersecting but for which x is not a subset of y and y is not a subset of x, or 3) x = y.

  • A134168: Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which either x is a subset of y or y is a subset of x, or 1) x and y are intersecting but for which x is not a subset of y and y is not a subset of x, or 2) x and y are intersecting and for which either x is a proper subset of y or y is a proper subset of x, or 3) x = y.

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

  • A134171: a(n) = (9/2)*(n-1)*(n-2)*(n-3).

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

  • A134183: A Hankel transform of a Catalan product.

  • A134201: Number of rigid hypergroups of order n.

  • A134202: Number of rigid Hv-groups of order n.

  • A134227: Row sums of triangle A134226.

  • A134230: a(n) = (10^n+1)^2-1.

  • A134238: Row sums of triangle A134237.

  • A134267: a(n) = |A090964(n+1) - A090964(n)|.

  • A134297: a(n) = 107*n.

  • A134301: Periodic sequence (0, 2, 6, 2, 0).

  • A134311: Row sums of triangle A134310.

  • A134327: a(n) = (n^5-n-5)/5.

  • A134341: Numbers whose fifth powers have a partition as a sum of fifth powers of four positive integers.

  • A134342: Accepted inputs by a certain adaptive automaton (number 4258072) with two adaptive functions and unary numbers as input.

  • A134350: Row sums of triangle A134349.

  • A134351: Binomial transform of [1, 5, -1, 5, -1, 5, …]. Inverse binomial transform of A134350.

  • A134353: Row sums of triangle A134352.

  • A134365: In base 2 the least number of positive numbers of (1+n) digits in which it can be read the totality of the 2^(n-1) positive numbers of n digits (0 excluded).

  • A134366: a(n) = (n!)^(n-1).

  • A134367: a(n) = (n!)^(n-2).

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

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

  • A134371: a(n) = ((2n)!)^n.

  • A134372: a(n) = ((2n)!)^2.

  • A134373: a(n) = ((2n)!)^3.

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

  • A134375: a(n) = (n!)^4.

  • A134393: Row sums of triangle A134392.

  • A134401: Row sums of triangle A134400.

  • A134405: -1 before list of quadruples -2n-1, 2n+2, -2n, 2n+1.

  • A134418: Row sums of triangle A134417.

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

  • A134430: Period 4: repeat [1, -2, -2, 1].

  • A134432: Sum of entries in all the arrangements of the set {1,2,…,n} (to n=0 there corresponds the empty set).

  • A134437: Number of cells in the 2nd rows of all deco polyominoes of height n. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.

  • A134441: Last two digits of primes of form 4n+1 (A002144), excluding 5. Leading 0’s omitted.

  • A134442: Last two digits of primes of form 4n+3 (A002145). Leading 0’s omitted.

  • A134451: Ternary digital root of n.

  • A134465: Row sums of triangle A134464.

  • A134467: a(n) = n(n+1) - A000120(n), where A000120(n) = number of 1’s in binary expansion of n.

  • A134478: Triangle read by rows, T(0,0) = 1; n-th row = (n+1) terms of n, n+1, n+2, …

  • A134479: Row sums of triangle A134478.

  • A134483: Triangle read by rows: T(n,k) = 2n + k - 2; 1 <= k <= n.

  • A134489: a(n) = Fibonacci(5*n + 2).

  • A134490: a(n) = Fibonacci(5n + 3).

  • A134491: a(n) = Fibonacci(5*n+4).

  • A134492: a(n) = Fibonacci(6*n).

  • A134493: a(n) = Fibonacci(6*n+1).

  • A134494: a(n) = Fibonacci(6n+2).

  • A134495: a(n) = Fibonacci(6n + 3).

  • A134497: a(n) = Fibonacci(6n+5).

  • A134498: a(n) = Fibonacci(7n).

  • A134499: a(n) = Fibonacci(7*n+1).

  • A134500: a(n) = Fibonacci(7n + 2).

  • A134501: a(n) = Fibonacci(7n + 3).

  • A134502: a(n) = Fibonacci(7n + 4).

  • A134503: a(n) = Fibonacci(7n + 5).

  • A134504: a(n) = Fibonacci(7n + 6).

  • A134519: Numbers remaining when the natural numbers (A000027) are arranged into a triangle and only the beginning and end terms of each row are retained.

  • A134522: a(n) = 2^n + ceiling(n/2).

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

  • A134547: a(n) = 5*n^2 + 20*n + 4.

  • A134582: a(n) = (2*n)^2 - 4.

  • A134593: a(n) = 5*n^2 + 10*n + 1. Coefficients of the rational part of (1 + sqrt(n))^5.

  • A134594: a(n) = n^2 + 10*n + 5: coefficients of the irrational part of (1 + sqrt(n))^5.

  • A134630: a(n) = 5*n^5 - 3*n^3 - 2*n^2.

  • A134633: 5*n^5 + 3*n^3 + 2*n^2. Coefficients and exponents are the prime numbers in decreasing order.

  • A134638: Row sums of triangle A134637.

  • A134641: Prime permutational numbers A134640.

  • A134667: Period 6: repeat [0, 1, 0, 0, 0, -1].

  • A134668: Period 6: repeat [1, -1, 0, 0, -1, 1].

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

  • A134684: n^(n+9).

  • A134693: a(n)=A133806(n)+A133806(n+6).

  • A134751: Hankel transform of expansion of (1/(1-x^2))c(x/(1-x^2)), where c(x) is the g.f. of A000108.

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

  • A134758: a(n) = A000984(n) + n.

  • A134759: a(n) = 2*A000984(n) - (n+1).

  • A134760: a(n) = 2*A000984(n) - 1.

  • A134762: a(n) = 3*A000984(n) - 2.

  • A134770: a(n) = 4*A000984(n) - 3.

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

  • A134803: Numbers n such that the sum of all numbers of the same parity <= n is equal to the sum of numbers of the opposite parity from n+1 to n+m, where m is odd and > 1.

  • A134804: Remainder of triangular number A000217(n) modulo 9.

  • A134813: a(n) = b(n+1)-2b(n) where b() is A134812.

  • A134859: Wythoff AAA numbers.

  • A134860: Wythoff AAB numbers; also, Fib101 numbers: those n for which the Zeckendorf expansion A014417(n) ends with 1,0,1.

  • A134861: Wythoff BAA numbers.

  • A134862: Wythoff ABB numbers.

  • A134863: Wythoff BAB numbers.

  • A134864: Wythoff BBB numbers.

  • A134868: A103451 * A002260.

  • A134869: Row sums of triangle A134868.

  • A134914: a(n) = ceiling(n^(1/3)).

  • A134916: Numbers n such that both 3^n+2 and 2^n+3 are primes.

  • A134927: a(0)=a(1)=1; a(n) = 3*(a(n-1) + a(n-2)).

  • A134931: a(n) = (5*3^n-3)/2.

  • A134934: a(n) = (14*n+1)^2.

  • A134953: Length of the longest prime implicant of the Y function of order n.

  • A134965: a(1)=3, a(n) = a(n-1) + 7 + 2*mod(n-1, 2) for n>=2.

  • A134967: List of quadruples: [-2n-1, 2n+2, -2n-1, 2n+2].

  • A134977: Period 6: repeat [1, 4, 2, 3, 0, 2].