110500

Appears in sequences

• Number of n-node steric rooted ternary trees; number of n carbon alkyl radicals C(n)H(2n+1) taking stereoisomers into account.at n=14A000625
• Numbers that are the sum of 2 nonzero squares in exactly 8 ways.at n=28A025291
• Numbers that are the sum of 2 nonzero squares in 7 or more ways.at n=31A025298
• Numbers that are the sum of 2 nonzero squares in 8 or more ways.at n=30A025299
• Numbers that are the sum of 2 distinct nonzero squares in exactly 8 ways.at n=28A025309
• Numbers that are the sum of 2 distinct nonzero squares in 7 or more ways.at n=31A025317
• Numbers that are the sum of 2 distinct nonzero squares in 8 or more ways.at n=30A025318
• Binomial transform of reflected pentanacci numbers A074062: a(n) = Sum_{k=0..n} binomial(n,k)*A074062(k).at n=24A074825
• Numbers n that are the hypotenuse of exactly 31 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 31 ways.at n=12A097244
• The common value of sigma_2 for square-amicable numbers, sigma_2(m)=sigma_2(n), m<n.at n=24A110929
• The common value of sigma_2 for square-amicable numbers, sigma_2(m)=sigma_2(n), m<n.at n=25A110929
• The common value of sigma_2 for square-amicable numbers, sigma_2(m)=sigma_2(n), m<n.at n=26A110929
• a(n) = A000043(n) - 3.at n=27A139480
• Triangle of coefficients from a polynomial recursion with row sum near =2*5^n: p(x,n)=(x + 1)*(p(x, n - 1) + 2*5^(n - 2)*(x + 5*x^Floor[n/2] + x^(n - 2))).at n=48A153354
• a(n) = A016755(n) - A001845(n).at n=25A188050
• Number of n X 6 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=17A208377
• a(n) is the least number that can be represented in exactly n ways as the sum of a prime and its digit reversal.at n=19A344871
• The smallest number k that can be partitioned in n ways as the sum of two numbers from A020487.at n=21A369384
• Sum of squares of divisors of the numbers m such that m and m+2 have the same sum of squares of divisors.at n=2A372114