31347

Appears in sequences

• a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=38A001209
• a(n) = (2*n - 11)*n^2.at n=27A015245
• Discriminants of totally complex sextic fields (negated).at n=32A023687
• Composite numbers whose prime factors contain no digits other than 3 and 4.at n=28A036314
• a(n) = 3*a(n-1) + 18*a(n-2), a(0)=0, a(1)=1.at n=7A080424
• Triangle, T(n, k, q) = e(n, k, q), where e(n, k, q) = ((1 - (-q)^k)/(1+q))*e(n-1, k, q) + (-q)^(k-1)*e(n-1, k-1, q), e(n, 0, q) = e(n, n, q) = 1, and q = 2, read by rows.at n=39A156535
• a(n) is the sum of all possible pairs of the first n primes.at n=25A162867
• Number of n-bead necklaces labeled with numbers 1..n allowing reversal, with no adjacent beads differing by more than 1.at n=11A208715
• Numbers that are the sum of seven fourth powers in exactly seven ways.at n=36A345829