59488

Appears in sequences

• Expansion of Product (1-m*q^m)^-16; m=1..inf.at n=5A022740
• a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is an integer, s(0) = 0, |s(1)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2, s(n) = 4. Also a(n) = T(n,n-4), where T is the array defined in A025177.at n=9A025182
• Eighth column (m=7) of (1,6)-Pascal triangle A096956.at n=10A097298
• Expansion of 1/(1-4*x+x^3).at n=8A099503
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=10A207166
• Number T(n,k) of permutations of [n] with exactly k occurrences of the consecutive step pattern up, down, down, down; triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-1)/4)), read by rows.at n=14A242820
• T(n, m), numerators of coefficients in a power/Fourier series expansion of the plane pendulum's exact differential time dependence.at n=41A274076
• The second Zagreb index of the Aztec diamond AZ(n) (see the Ramanes et al. reference, Theorem 2.2).at n=29A292345
• The PDO_t(n) function (Number of tagged parts over all the partitions of n with designated summands in which all parts are odd).at n=37A293422
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n*b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, and (a(n)) and (b(n)) are increasing complementary sequences.at n=17A296286
• a(n) = (1/2) * Sum_{|k|<=2*sqrt(p)} k^4*H(4*p-k^2) where H() is the Hurwitz class number and p is n-th prime.at n=10A297491
• a(n) = n*(n^2 - 2*n + 4)*binomial(2*n,n)/((n + 1)*(n + 2)).at n=8A301972
• Number T(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the set; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=32A319501
• Number of sets of nonempty words with a total of n letters over quaternary alphabet such that all letters occur at least once in the set.at n=3A320205