33264

Appears in sequences

• Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=31A002414
• Apéry numbers: a(n) = n^2*C(2n,n).at n=6A002736
• Triangulations of a square with no separating triangles (previously "Bordered triangulations of sphere with n nodes").at n=9A006674
• a(n) is the concatenation of n and 8n.at n=32A009470
• Smallest number that is palindromic (with at least 2 digits) in n bases.at n=44A037183
• Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.at n=26A069466
• Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.at n=22A069466
• Numbers n such that n + (sum of prime factors of n) = next prime after n.at n=37A105779
• Triangle read by rows: number of order-preserving partial transformations (of an n-element chain) of width and waist both equal to r (width(alpha) = |Dom(alpha)| and waist(alpha) = max(Im(alpha))).at n=52A110858
• a(0) = a(1) = 1, a(2) = x, a(3) = 2x^2, a(n) = x*(n-1)*a(n-1) + Sum_{j=2..n-2} (j-1)*a(j)*a(n-j), n>=4 and for x = 6.at n=5A113133
• Triangle read by rows: T(n,k) = binomial(n-1,k-1)*binomial(n,k-1)/k + binomial(n-1,k)*binomial(n,k)/(k+1) (1 <= k <= n). In other words, to each entry of the Narayana triangle (A001263) add the entry on its right.at n=59A118976
• Triangle read by rows: T(n,k) = binomial(n-1,k-1)*binomial(n,k-1)/k + binomial(n-1,k)*binomial(n,k)/(k+1) (1 <= k <= n). In other words, to each entry of the Narayana triangle (A001263) add the entry on its right.at n=60A118976
• Sum of all n-digit Apery numbers.at n=4A131972
• Partial products of A000032 (Lucas numbers beginning at 2).at n=6A135407
• Seventh column (k=6) of triangle A134832 (circular succession numbers).at n=6A135804
• Sign weighted matrices n X n:example {{2 w[2], w[0], w[1]}, {3 w[0], 2 w[1], w[2]}, {3 w[1], 3 w[2], 2 w[0]}} are made into monomials using w[n]=1 if n<>0, x if n==0. The coefficients of the monomials form a triangular sequence.at n=51A140326
• Duplicate of A069466.at n=22A141902
• Duplicate of A069466.at n=26A141902
• Shifts left when Dirichlet convolution (DC:(b,b)->a) applied 5 times.at n=4A144319
• Square array A(n,k), n>=1, k>=1, read by antidiagonals, with A(1,k)=1 and sequence a_k of column k shifts left when Dirichlet convolution (DC:(b,b)->a) applied k times.at n=40A144324