83655

Appears in sequences

• Number of irreducible alternating Euler sums of depth 6 and weight 6+2n.at n=32A011796
• a(n) = C(n+2, 2) + C(n+2, 3) + C(n+2, 4) + C(n+2, 5).at n=24A027660
• Triangle read by rows: T(n, k) = binomial(3*n, k-1) + binomial(3*n, n-k).at n=39A156003
• Triangle read by rows: T(n, k) = binomial(3*n, k-1) + binomial(3*n, n-k).at n=41A156003
• a(n) = 13*a(n-1) - 65*a(n-2) + 156*a(n-3) - 182*a(n-4) + 91*a(n-5) - 13*a(n-6), with initial terms 6, 13, 39, 130, 455, 1638.at n=8A216508
• Abundant numbers whose aliquot sequence is abundant, deficient, abundant, ..., etc.at n=16A234969
• Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010011.at n=7A260765
• a(n) = H(n-1, n, n+1) where H(a, b, c) = (a + b + c)*(a + b - c)*(b + c - a)*(c + a - b) is Heron's polynomial.at n=13A339488
• Number of subsets of 6 integers between 1 and n such that their sum is 1 modulo n.at n=32A381290