41308

Appears in sequences

• Number of noncongruent integer-sided 5-dimensional simplices with largest side n.at n=4A097127
• The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts.at n=43A102186
• Number of base 20 circular n-digit numbers with adjacent digits differing by 8 or less.at n=4A125455
• Sequence obtained from Fibonacci numbers by taking the factorials of each digit and summing.at n=41A164955
• Coefficients of infinite sum polynomials; p(x,n)=If[Mod[n, 2] == 1, (1 - x)^(n + 1)*Sum[(k + 1)*(1 + k + k^2)^Floor[(n - 1)/2]* x^k, {k, 0, Infinity}], (1 - x)^(n + 1)*Sum[(1 + k + k^2)^Floor[n/2]*x^ k, {k, 0, Infinity}]].at n=47A169625
• Least integer k > 1 such that pi(k)^2 + pi(k*n)^2 is a square, where pi(.) is the prime-counting function given by A000720.at n=30A255677
• Index in A092243 where -n first appears.at n=3A269738
• a(n) is the coefficient of x^n/n! in exp(x + n*x^2/2).at n=7A277614
• For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u*x+v*y with u,v minimal; a(n) = sum of the values of u^2+v^2.at n=31A345434