Skip to content

Summary of block A133

135 sequences
  • A133006: Incorrect version of A001969.

  • A133007: Incorrect version of A000069.

  • A133012: Even imperfect numbers.

  • A133016: Even imperfect numbers, divided by 2.

  • A133043: Number of segments needed to draw the spiral of equilateral triangles with side lengths which follow the Padovan sequence.

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

  • A133071: a(n) = n^5 - n^3 + n^2.

  • A133072: a(n) = n^5 + n^3 - n^2.

  • A133073: a(n) = n^5 + n^3 + n^2.

  • A133083: A000012 * A133080.

  • A133086: Row sums of triangle A133085.

  • A133092: Row sums of triangle A133091.

  • A133095: Row sums of triangle A133094.

  • A133124: A007318 * [1, 2, 2, 3, 2, 3, 2, 3, 2, …].

  • A133125: a(n) = (7*3^n - (-3)^n)/6.

  • A133140: a(0) = 2, a(n) = 2^n + 2 for n>=1.

  • A133145: Period 4: repeat [1, 2, 4, 8].

  • A133146: Antidiagonal sums of the triangle A133128.

  • A133161: Indices of the triangular numbers which are also centered triangular number.

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

  • A133196: n+2 repeated n times.

  • A133209: a(n) = 4a(n-1) - 6a(n-2) + 4a(n-3), n > 3; a(0) = 3, a(1) = 2, a(2) = a(3) = 0.

  • A133221: A001147 with each term repeated.

  • A133223: Sum of digits of primes (A007605), sorted and with duplicates removed.

  • A133224: Let P(A) be the power set of an n-element set A and let B be the Cartesian product of P(A) with itself. Remove (y,x) from B when (x,y) is in B and x <> y and let R35 denote the reduced set B. Then a(n) = the sum of the sizes of the union of x and y for every (x,y) in R35.

  • A133252: Partial sums of A006000.

  • A133256: a(4*n+1) = 4*n+1, a(4*n+2) = 4*n+2, a(4*n+3) = 4*n+4, a(4*n+4) = 4*n+3.

  • A133257: The number of edges on a piece of paper that has been folded n times (see comments for more precise definition).

  • A133259: a(6n) = 6n+1, a(6n+1) = 6n+2, a(6n+2) = 6n+3, a(6n+3) = 6n+6, a(6n+4) = 6n+5, a(6n+5) = 6n+4.

  • A133263: Binomial transform of (1, 2, 0, 1, -1, 1, -1, 1, …).

  • A133265: Diagonal of the A135356 triangle.

  • A133271: Indices of 7-gonal numbers which are also centered 7-gonal numbers.

  • A133272: Indices of centered heptagonal numbers (A069099) which are also heptagonal numbers (A000566).

  • A133273: Indices of centered decagonal numbers which are also decagonal numbers.

  • A133275: Numbers X such that 30*X^2-45 is a square.

  • A133280: Triangle formed by: 1 even, 2 odd, 3 even, 4 odd, … starting with zero.

  • A133283: Numbers k such that 30*k^2 + 6 is a square.

  • A133284: Indices of the 12-gonal numbers which are also centered 12-gonal number or numbers X such that 30*X^2-24*X+3 is a square.

  • A133285: Indices of the centered 12-gonal numbers which are also 12-gonal number, or numbers X such that 120*X^2-120*X+36 is a square.

  • A133292: Period 9: repeat [1, 1, 2, 4, 7, 2, 7, 4, 2].

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

  • A133310: a(3n) = 2n+1, a(3n+1) = 2n+2, a(3n+2) = 2n+1.

  • A133320: Numbers k such that both A124296(k) = 5*F(k)^2 - 5*F(k) + 1 and A124297(k) = 5*F(k)^2 + 5*F(k) + 1 are prime, where F(k) = Fibonacci(k).

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

  • A133343: a(n) = 2*a(n-1) + 13*a(n-2), for n>1, a(0)=1, a(1)=1.

  • A133345: a(n) = 2*a(n-1) + 14*a(n-2) for n>1, a(0)=1, a(1)=1.

  • A133356: a(n) = 2*a(n-1) + 16*a(n-2) for n>1, a(0)=1, a(1)=1.

  • A133368: Period 5: 1, 1, 3, 7, 3.

  • A133376: a(n) = (…((2^3)^4)^…)^n.

  • A133378: a(1)=1. For n >= 2, a(n) = the largest prime divisor of (a(n-1)^a(n-1) + 1).

  • A133383: 10 followed by 2n 9’s.

  • A133384: Numbers with n 0’s between 1 and 2.

  • A133398: Numbers that are not Mersenne primes.

  • A133405: a(n) = 3*a(n-1) - a(n-3) + 3*a(n-4), with initial values 0,0,0,1.

  • A133407: a(n) = a(n-1) + 5*a(n-2) for n >= 2, a(0)=1, a(1)=2.

  • A133409: Zero followed by partial sums of A133405.

  • A133448: a(n) = 3*a(n-1) - a(n-3) + 3*a(n-4), with initial values 2,5,13,40.

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

  • A133460: 3^n*2^(n^2).

  • A133461: 4^n*3^(n^2).

  • A133462: a(n+1)-10a(n)=3(-3, -2, -1, 0, 1, 2, 3, 4, 5 …).

  • A133464: a(3n)=4^n, a(3n+1)=2*4^n, a(3n+2)=3*4^n.

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

  • A133468: A080814 complemented, then interpreted as binary and then re-expressed in decimal form (e.g., “1221” = “0110”). Alternately, view as A080814 with “1” mapped to “1” and “2” mapped to “0”.

  • A133469: a(n) = a(n-1) + 7*a(n-2) for n >= 2, a(0)=1, a(1)=2.

  • A133472: a(n) = 10^n + 5.

  • A133473: 2 followed by numbers with n-1 3’s before 5.

  • A133479: a(n) = a(n-1) + 8*a(n-2) for n >= 2, a(0)=1, a(1)=2.

  • A133480: Left 3-step factorial (n,-3)!: a(n) = (-1)^n * A008544(n).

  • A133483: A way of splitting the numbers from 1 to 16 into two groups so that the numbers in each group have the same sum, the same sum of squares and the same sum of cubes.

  • A133484: A way of splitting the numbers from 1 to 16 into two groups so that the numbers in each group have the same sum, the same sum of squares and the same sum of cubes.

  • A133494: Diagonal of the array of iterated differences of A047848.

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

  • A133499: a(n) = n^7 - n.

  • A133508: Record numbers of steps associated with the terms of A133503.

  • A133510: Number of primitive H-invariant prime ideals in O_q(M_{2,n}) generic quantum matrices.

  • A133546: Binomial transform of [1,3,5,6,7,8,9,10,11,…] (i.e., positive integers except 2 and 4).

  • A133558: a(n) = a(n-1) + 9*a(n-2) for n >= 2, a(0)=1, a(1)=2.

  • A133572: Row sums of triangle A133571.

  • A133577: a(n) = a(n-1) + 10*a(n-2) for n >= 2, a(0)=1, a(1)=2.

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

  • A133592: a(n) = 2*a(n-1)+6*a(n-2) for n>=3, a(0)=1, a(1)=2, a(2)=8.

  • A133600: Row sums of triangle A133599.

  • A133620: Binomial(n+p,n) mod n where p=10.

  • A133622: a(n) = 1 if n is odd, a(n) = n/2+1 if n is even.

  • A133623: Binomial(n+p, n) mod n where p=3.

  • A133624: Binomial(n+p, n) mod n, where p=4.

  • A133625: Binomial(n+p, n) mod n where p=5.

  • A133628: a(1)=1, a(n) = a(n-1) + (p-1)*p^(n/2-1) if n is even, else a(n) = a(n-1) + p^((n-1)/2), where p=4.

  • A133629: a(1)=1, a(n) = a(n-1) + (p-1)*p^(n/2-1) if n is even, otherwise a(n) = a(n-1) + p^((n-1)/2), where p=5.

  • A133631: a(n) = a(n-1) - 4*a(n-2), a(0)=1, a(1)=2.

  • A133632: a(1)=1, a(n) = (p-1)*a(n-1), if n is even, otherwise a(n) = p*a(n-2), where p = 5.

  • A133641: a(n) = 2*L(n) + L(n-1) - n, L(n) = n-th Lucas number A000204(n).

  • A133647: A133566 * A000244.

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

  • A133649: A007318^(-1) * A133648.

  • A133653: A007318^(-1) * A003261.

  • A133654: a(n) = 2*A000129(n) - 1.

  • A133655: a(n) = 2*A016777(n) + A016777(n-1) - (n+1).

  • A133665: a(n) = a(n-1) - 9*a(n-2), a(0) = 1, a(1) = 3.

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

  • A133751: a(n) = 2*(2+n)! + 2^n.

  • A133752: a(n) = 256^n.

  • A133754: a(n) = n^5 - n^3.

  • A133766: a(n) = (4*n+1)*(4*n+3)*(4*n+5).

  • A133767: a(n) = (4*n+3)*(4*n+5)*(4*n+7).

  • A133784: Positive integers n such that the sum of all primes <= n divides n(n+1)/2.

  • A133789: Let P(A) denote 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 x is not a subset of y and y is not a subset of x, 1) x and y are disjoint and for which either x is a subset of y or y is a subset of x, or 2) x and y intersect but for which x is not a subset of y and y is not a subset of x.

  • A133798: a(n) = A002467(n) - 1.

  • A133852: a(n) = A000040(n) - A133578(n).

  • A133853: a(n) = (64^n - 1)/63.

  • A133858: Primes of the form 11^k - 2.

  • A133872: Period 4: repeat [1, 1, 0, 0].

  • A133873: n modulo 3 repeated 3 times.

  • A133874: n modulo 4 repeated 4 times.

  • A133875: n modulo 5 repeated 5 times.

  • A133876: n modulo 6 repeated 6 times.

  • A133877: n modulo 7 repeated 7 times.

  • A133878: n modulo 8 repeated 8 times.

  • A133879: n modulo 9 repeated 9 times.

  • A133880: n modulo p repeated p times (where p=10).

  • A133882: a(n) = binomial(n+2,n) mod 2^2.

  • A133883: a(n) = binomial(n+3,n) mod 3^2.

  • A133884: a(n) = binomial(n+4,n) mod 4.

  • A133887: Binomial(n+7,n) mod 7^2.

  • A133888: Binomial(n+8,n) mod 8.

  • A133889: a(n) = binomial(n+9,n) mod 9.

  • A133893: Numbers m such that binomial(m+3,m) mod 3 = 0.

  • A133894: Numbers m such that binomial(m+4,m) mod 4 = 0.

  • A133895: Numbers m such that binomial(m+5,m) mod 5 = 0.

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

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

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

  • A133989: Define fu(1,1) = 0. Then a(n) = fu(1,n) = smallest number t such that an n X 1 strip of n squares can be cut into n squares using p_1, p_2, …, p_t cuts where p_t is a prime number or p_t = 1.

  • A133993: a(n) = a(n-1) + 3*a(n-2) - a(n-3) - 2*a(n-4), n > 3.