Skip to content

Summary of block A053

105 sequences
  • A053016: Numbers of vertices of Platonic solids in the order tetrahedron, octahedron, cube, icosahedron, dodecahedron. Equally, numbers of faces of Platonic solids in the order tetrahedron, cube, octahedron, dodecahedron, icosahedron.

  • A053041: Smallest n-digit number divisible by n.

  • A053042: a(n) = n^n + n!.

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

  • A053100: a(n) = ((6*n+7)(!^6))/7, related to A008542 ((6*n+1)(!^6) sextic, or 6-factorials).

  • A053101: a(n) = ((6*n+8)(!^6))/8(!^6), related to A034689 (((6*n+2)(!^6))/2 sextic, or 6-factorials).

  • A053102: a(n) = ((6*n+9)(!^6))/9(!^6), related to A034723 (((6*n+3)(!^6))/3 sextic, or 6-factorials).

  • A053103: a(n) = ((6*n+10)(!^6))/10(!^6), related to A034724 (((6*n+4)(!^6))/4 sextic, or 6-factorials).

  • A053104: a(n) = ((7*n+8)(!^7))/8, related to A045754 ((7*n+1)(!^7) sept-, or 7-factorials).

  • A053105: a(n) = ((7*n+9)(!^7))/9(!^7), related to A034829 (((7*n+2)(!^7))/2 sept-, or 7-factorials).

  • A053106: a(n) = ((7*n+10)(!^7))/10(1^7), related to A034830 (((7*n+3)(!^7))/3 sept-, or 7-factorials).

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

  • A053112: Expansion of (-1 + 1/(1-9*x)^9)/(81*x); related to A053108.

  • A053114: a(n) = ((8*n+9)(!^8))/9, related to A045755 ((8*n+1)(!^8) octo- or 8-factorials).

  • A053115: a(n) = ((8*n+10)(!^8))/20, related to A034908 ((8*n+2)(!^8) octo- or 8-factorials).

  • A053116: a(n) = ((9*n+10)(!^9))/10, related to A045756 ((9*n+1)(!^9) 9-factorials).

  • A053126: Binomial coefficients binomial(2*n-3,4).

  • A053127: Binomial coefficients C(2*n-4,5).

  • A053129: Binomial coefficients C(2*n-6,7).

  • A053131: Binomial coefficients C(2*n-8,9).

  • A053134: Binomial coefficients C(2*n+4,4).

  • A053135: Binomial coefficients C(2*n+6,6).

  • A053136: Binomial coefficients C(2*n+7,7).

  • A053137: Binomial coefficients C(2*n+8,8).

  • A053138: Binomial coefficients C(2*n+9,9).

  • A053141: a(0)=0, a(1)=2 then a(n) = a(n-2) + 2*sqrt(8*a(n-1)^2 + 8*a(n-1) + 1).

  • A053142: a(n) = A053141(n)/2.

  • A053152: Number of 2-element intersecting families whose union is an n-element set.

  • A053154: Number of 2-element intersecting families (with not necessarily distinct sets) of an n-element set.

  • A053156: Number of 2-element intersecting families (with not necessarily distinct sets) whose union is an n-element set.

  • A053186: Square excess of n: difference between n and largest square <= n.

  • A053208: Row sums of A053207.

  • A053209: Row sums of A051598.

  • A053214: Central binomial coefficients (A000984) read mod 2n, with a(0)=1.

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

  • A053221: Row sums of triangle A053218.

  • A053311: Partial sums of A000285.

  • A053347: a(n) = binomial(n+7, 7)*(n+4)/4.

  • A053368: a(n) = (5n+2)*C(n) where C(n) = Catalan numbers (A000108).

  • A053369: Linear recursion with Catalan numbers.

  • A053404: Expansion of 1/((1+3*x)*(1-4*x)).

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

  • A053422: n times (n 1’s): a(n) = n*(10^n - 1)/9.

  • A053428: a(n) = a(n-1) + 20*a(n-2), n >= 2; a(0)=1, a(1)=1.

  • A053430: a(n) = (6^(n+1) - (-5)^(n+1))/11.

  • A053436: a(n) = n+1 + ceiling(n/2)*(ceiling(n/2)-1)*(ceiling(n/2)+1)/6.

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

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

  • A053455: a(n) = ((8^n) - (-6)^n)/14.

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

  • A053469: a(n) = n*6^(n-1).

  • A053482: Binomial transform of A029767.

  • A053486: E.g.f.: exp(3x)/(1-x).

  • A053487: E.g.f.: exp(4x)/(1-x).

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

  • A053524: a(n) = (6^n - (-2)^n)/8.

  • A053535: Expansion of 1/((1+3*x)*(1-9*x)).

  • A053536: Expansion of 1/((1+4*x)*(1-12*x)).

  • A053537: Expansion of 1/((1+5*x)*(1-15*x)).

  • A053539: a(n) = n * 8^(n-1).

  • A053540: a(n) = n*9^(n-1).

  • A053541: a(n) = n*10^(n-1).

  • A053545: Comparisons needed for Batcher’s sorting algorithm applied to 2^n items.

  • A053565: a(n) = 2^(n-1)*(3*n-4).

  • A053573: a(n) = 5*a(n-1) + 14*a(n-2), a(0)=1, a(1)=5.

  • A053581: First differences of the Poly-Bernoulli numbers B_n^(k) with k=-2 (A027649).

  • A053599: Number of nonempty subsequences {s(k)} of 1..n such that the difference sequence is palindromic.

  • A053602: a(n) = a(n-1) - (-1)^n*a(n-2), a(0)=0, a(1)=1.

  • A053606: a(n) = (Fibonacci(6*n+3) - 2)/4.

  • A053611: Numbers k such that 1 + 4 + 9 + … + k^2 = 1 + 2 + 3 + … + m for some m.

  • A053614: Numbers that are not the sum of distinct triangular numbers.

  • A053618: a(n) = ceiling(binomial(n,4)/n).

  • A053630: Pythagorean spiral: a(n-1), a(n)-1 and a(n) are sides of a right triangle.

  • A053631: Pythagorean spiral: a(n-1)+1, a(n) and a(n)+1 are the sides of a right triangle (a primitive Pythagorean triangle).

  • A053637: a(n) = ceiling(2^(n-1)/n).

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

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

  • A053644: Most significant bit of n, msb(n); largest power of 2 less than or equal to n; write n in binary and change all but the first digit to zero.

  • A053645: Distance to largest power of 2 less than or equal to n; write n in binary, change the first digit to zero, and convert back to decimal.

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

  • A053699: a(n) = n^4 + n^3 + n^2 + n + 1.

  • A053700: a(n) = 111111 in base n.

  • A053716: a(n) = 1111111 in base n.

  • A053717: a(n) = n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.

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

  • A053735: Sum of digits of (n written in base 3).

  • A053741: Sum of even numbers in range 10*n to 10*n+9.

  • A053742: Sum of odd numbers in range 10*n to 10*n+9.

  • A053743: Sum of numbers in range 10*n to 10*n+9.

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

  • A053763: a(n) = 2^(n^2 - n).

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

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

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

  • A053793: n^2+n modulo 7.

  • A053794: a(n) = (n^2 + n) modulo 8.

  • A053796: a(n) = (n^2+n) modulo 5.

  • A053799: Number of basis partitions of n+9 with Durfee square size 3.

  • A053817: a(0)=1, a(n) = n*(a(n-1) + n).

  • A053838: a(n) = (sum of digits of n written in base 3) modulo 3.

  • A053839: a(n) = (sum of digits of n written in base 4) modulo 4.

  • A053840: (Sum of digits of n written in base 5) modulo 5.

  • A053879: a(n) = n^2 mod 7.

  • A053986: a(n) = n^(n!).

  • A053991: Number of distinct residues of generalized Catalan number 1/((n^2-1)*k + 1)*binomial(n^2*k, k) modulo n^2 as k runs through the positive integers.