31008

Appears in sequences

• Fibonacci sequence beginning 0, 12.at n=18A022346
• Theta series of A*_19 lattice.at n=75A023931
• a(n) = number of (s(0), s(1), ..., s(2n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 3, s(2n) = 7. Also a(n) = T(2n,n-2), where T is defined in A026022.at n=7A026031
• Theta series of odd 8-dimensional 5-modular lattice O(5).at n=37A029719
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 11.at n=17A031689
• "DHK[ 6 ]" (bracelet, identity, unlabeled, 6 parts) transform of 1,1,1,1,...at n=28A032247
• Number of partitions of n into parts not of the form 11k, 11k+5 or 11k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=47A035948
• Number of border edges in all noncrossing rooted trees on n nodes.at n=6A045722
• T(n,k)=S(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=40A050162
• a(n) = lcm(n, phi(n), n - phi(n)).at n=50A052100
• T(2n-1,n), array T as in A054144.at n=6A054149
• T(2n+3,n), array T as in A055794.at n=15A055796
• Numbers k that can be expressed as k = w + x = y*z with w*x = y^3 + z^3 where w, x, y, and z are all positive integers.at n=39A057372
• Number of walks of length n between two nodes at distance 2 in the cycle graph C_9.at n=17A095367
• Sixth column of (1,5)-Pascal triangle A096940.at n=15A096943
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross the x-axis k times (n>=1, k>=0).at n=48A118920
• Rectangular array read by antidiagonals: a(n, k) is the number of ways to put k labeled objects into n labeled boxes so that there is one box with exactly one object (n, k >= 1).at n=62A131104
• Coefficients in a q-analog of the function [LambertW(-2x)/(-2x)]^(1/2), as a triangle read by rows.at n=43A152550
• a(n) = n*(n+1)*(n+2)*(n+3)/3.at n=16A162668
• Convolution of A008805 (triangular numbers repeated) with itself.at n=31A177747