21476

Appears in sequences

• Numbers that are the sum of 11 positive 8th powers.at n=40A003389
• Number of labeled mating graphs with n nodes. Also called point-determining graphs.at n=6A006024
• Longest edge a of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=29A031173
• Multiplicity of highest weight (or singular) vectors associated with character chi_153 of Monster module.at n=40A034541
• Indices of triple-safe primes: p=prime(n) is double-safe: q=(p-1)/2, r=(q-1)/2 and s=(r-1)/2 are all prime (and q is double-safe).at n=21A075134
• G.f.: A(x) = Product_{n>=1} 1/(1 - 4^n*x^n)^(2/4^n); self-convolution equals A110154.at n=8A110156
• Inverse Euler transform of A003480.at n=10A141312
• Numbers x such that sigma(x) + sigma(R(x)) = sigma(x + R(x)), where R(x) is the digit reversal of x and sigma(x) is the sum of the divisors of x.at n=22A246487
• a(n) = (1/2)*A291730(n).at n=9A291731
• Number of simple graphs on n unlabeled nodes with maximum degree exactly 2.at n=25A324740
• Number of compositions (ordered partitions) of n into distinct parts, the least being 6.at n=58A339169
• a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(5*k,k) / (4*k + 1).at n=6A346681