34155

Appears in sequences

• Expansion of 1/((1-x)(1-3x)(1-4x)(1-11x)).at n=4A021394
• McKay-Thompson series of class 25A for Monster.at n=33A058594
• a(n) = n * [1 + sum(k=1 to n) prime(k)].at n=27A083725
• Denominator of 2*Sum(C(n,w)/(2*w+1),w=0..n/2-1)+C(n,n/2)/(n+1) if n is even, or of 2*Sum(C(n,w)/(2*w+1),w=0..(n-1)/2) if n is odd.at n=41A085569
• Coefficient of the irreducible character of S_m indexed by (m-2n+2,2n-2) in the n-th Kronecker power of the representation indexed by (m-2,2).at n=23A090809
• a(n) = 6 + floor( Sum_{j=1..n-1} a(j)/4 ).at n=39A120164
• Odd infinitary abundant numbers.at n=25A127666
• Odd doubly abundant numbers (A125639).at n=1A129087
• Smallest odd number k such that is equal to the sum of its proper divisors greater than k^(1/n), or 0 if none exist.at n=0A182292
• a(n) = Sum_{i=1..n} (3i)^2.at n=22A220443
• Numbers n such that Sum_{i = 1..q} 1/d(i) is an integer where d(i) are the divisors of n for some q and n is primitive (the set {d(1), d(2), ..., d(q)} appears only once).at n=16A226853
• Let p = n-th prime == 3 mod 8; a(n) = (sum of quadratic residues mod p that are < p/2) + (sum of all quadratic residues mod p).at n=17A282727
• Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2*k, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=28A293186
• a(n) = Sum_{k=0..floor(n/4)} binomial(n-3*k-1,k) * binomial(k,n-4*k).at n=40A383584
• Odd numbers k that are closer to being perfect than previous terms and also satisfy the condition that gcd(k, A003961(k)) is equal to gcd(sigma(k), A003961(k)), where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.at n=9A386421