Skip to content

Summary of block A054

102 sequences
  • A054000: a(n) = 2*n^2 - 2.

  • A054027: Numbers that do not divide their sum of divisors.

  • A054066: Position of n-th 1 in A054065.

  • A054071: Position of 1 in the permutation of 1,2,…,n obtained by ordering the fractional parts {h*sqrt(2)} for h=1,2,…,n.

  • A054074: Position of n-th 1 in A054073.

  • A054087: s(3n-2), s=A054086; also a bisection of A003511.

  • A054088: a(n) = A054086(3n); also a bisection of A003511.

  • A054091: Row sums of A054090.

  • A054099: Sum{T(n,k): k=0,1,…,n}, array T as in A054098.

  • A054109: a(n) = T(2*n+1, n), array T as in A054106.

  • A054111: Row sums of array T as in A054110.

  • A054113: T(2*n,n), array T as in A054110.

  • A054116: T(n,n-1), array T as in A054115.

  • A054117: T(n,n-2), array T as in A054115.

  • A054119: a(n) = n! + (n-1)! + (n-2)!.

  • A054127: a(1) = 2; a(n) = 9*2^(n-2) - n - 2, n>1.

  • A054135: a(n) = T(n,1), array T as in A054134.

  • A054136: a(n) = T(n,2), array T as in A054134.

  • A054145: Row sums of array T as in A054144.

  • A054146: a(n) = A054145(n)/2.

  • A054147: a(n) = T(2n,n), array T as in A054144.

  • A054201: a(n) = (n-1)! * Sum_{k=1..n} k^k/k!.

  • A054202: a(n) = (n-1)! * Sum_{k=1..n} floor(k^k/k!).

  • A054248: Binary entropy: a(n) = n + min { a(k)+a(n-k) : 1 <= k <= n-1 }.

  • A054254: a(n) is n plus the minimum of the a(i)*a(n-i) of the previous i = 1..n-1.

  • A054275: Susceptibility series H_2 for 2-dimensional Ising model (divided by 2).

  • A054318: a(n)-th star number (A003154) is a square.

  • A054319: Duplicate of A006061.

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

  • A054322: Fourth unsigned column of Lanczos triangle A053125 (decreasing powers).

  • A054329: One quarter of fourth unsigned column of Lanczos’ triangle A053125.

  • A054337: 7-fold convolution of A000302 (powers of 4).

  • A054338: 8-fold convolution of A000302 (powers of 4).

  • A054339: 9-fold convolution of A000302 (powers of 4).

  • A054340: 10-fold convolution of A000302 (powers of 4).

  • A054401: 5^n-4^n-1.

  • A054405: Row sums of array T as in A055215.

  • A054406: Beatty sequence for (3+sqrt 3)/2; complement of A022838.

  • A054413: a(n) = 7*a(n-1) + a(n-2), with a(0)=1 and a(1)=7.

  • A054414: a(n) = 1 + floor(n/(1-log(2)/log(3))).

  • A054429: Simple self-inverse permutation of natural numbers: List each block of 2^n numbers (from 2^n to 2^(n+1) - 1) in reverse order.

  • A054451: Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).

  • A054452: Partial sums of A027941(n-1) with a(-1) = 0.

  • A054459: A001333(n), n >= 1, convolved with itself.

  • A054477: A Pellian-related sequence.

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

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

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

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

  • A054490: Expansion of (1+5*x)/(1-6*x+x^2).

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

  • A054492: a(n) = 3*a(n-1) - a(n-2), a(0)=1, a(1)=6.

  • A054493: A Pellian-related recursive sequence.

  • A054516: Equivalent of the Kurepa hypothesis for left factorial.

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

  • A054554: a(n) = 4*n^2 - 10*n + 7.

  • A054556: a(n) = 4*n^2 - 9*n + 6.

  • A054559: Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 8 1-simplexes.

  • A054563: a(n) = n*(n^2 - 1)*(n + 2)*(n^2 + 4*n + 6)/72.

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

  • A054569: a(n) = 4*n^2 - 6*n + 3.

  • A054577: A Catalan-like sequence.

  • A054579: n^2+n modulo 17.

  • A054580: n^2 modulo 17.

  • A054602: a(n) = Sum_{d|3} phi(d)*n^(3/d).

  • A054603: a(n) = Sum_{d|4} phi(d)*n^(4/d).

  • A054604: a(n) = Sum_{d|5} phi(d)*n^(5/d).

  • A054605: a(n) = Sum_{d|6} phi(d)*n^(6/d).

  • A054606: a(n) = Sum_{d|7} phi(d)*n^(7/d).

  • A054607: a(n) = Sum_{d|8} phi(d)*n^(8/d).

  • A054620: Number of ways to color vertices of a pentagon using <= n colors, allowing only rotations.

  • A054622: Number of ways to color vertices of an octagon using <= n colors, allowing only rotations.

  • A054650: Nearest integer to 2^(n-1)/n.

  • A054770: Numbers that are not the sum of distinct Lucas numbers 1,3,4,7,11, … (A000204).

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

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

  • A054783: (n^2)-th Fibonacci number.

  • A054849: a(n) = 2^(n-5)*binomial(n,5). Number of 5D hypercubes in an n-dimensional hypercube.

  • A054851: a(n) = 2^(n-7)*binomial(n,7). Number of 7D hypercubes in an n-dimensional hypercube.

  • A054861: Greatest k such that 3^k divides n!.

  • A054868: Sum of bits of sum of bits of n: a(n) = wt(wt(n)).

  • A054874: a(n) = 2^(sum of a(i) where i<n).

  • A054878: Number of closed walks of length n along the edges of a tetrahedron based at a vertex.

  • A054879: Closed walks of length 2n along the edges of a cube based at a vertex.

  • A054880: a(n) = 3*(9^n - 1)/4.

  • A054881: Number of walks of length n along the edges of an octahedron starting and ending at a vertex and also ( with a(0)=0 ) between two opposite vertices.

  • A054886: Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3,Pi/3,0) (this is the classical modular tessellation).

  • A054888: Layer counting sequence for hyperbolic tessellation by regular pentagons of angle Pi/2.

  • A054890: Layer counting sequence for hyperbolic tessellation by regular heptagons of angle Pi/3.

  • A054893: a(n) = Sum_{j > 0} floor(n/4^j).

  • A054895: a(n) = Sum_{k>0} floor(n/6^k).

  • A054896: a(n) = Sum_{k>0} floor(n/7^k).

  • A054897: a(n) = Sum_{k>0} floor(n/8^k).

  • A054898: a(n) = Sum_{k>0} floor(n/9^k).

  • A054899: a(n) = Sum_{k>0} floor(n/10^k).

  • A054909: Number of 8n-dimensional even unimodular lattices (or quadratic forms).

  • A054925: a(n) = ceiling(n*(n-1)/4).

  • A054961: Maximal number of binary vectors of length n such that the unions (or bitwise ORs) of any 2 distinct vectors are all distinct.

  • A054963: Number of cells in the first column of all directed column-convex polyominoes of area n+1.

  • A054968: 3*Fibonacci(n) - 11.

  • A054977: a(0)=2, a(n)=1 for n >= 1.

  • A054995: A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,…,n in a circle, increasing clockwise. Starting with i=1, delete the integer two places clockwise from i. Repeat, counting two places from the next undeleted integer, until only one integer remains.