51597

Appears in sequences

• Expansion of 1/((1-2x)(1-4x)(1-7x)(1-10x)).at n=4A025973
• Smallest number having n divisors ending with 1 or 9.at n=14A085645
• a(1)=1, a(n)=a(n-1)+n^2 if n odd, a(n)=a(n-1)+ n^3 if n is even.at n=24A140149
• Eigentriangle of A085478: T(n,k) = A085478(n,k) * A125273(k).at n=42A144250
• G(n,1) with n index G(n,i)=n*(G(n,i-1)+G(n,i-2))=(a^i-b^i)*d where d=sqrt(n*(n+4)); a=(n+d)/2; b=(n-d)/2.at n=7A170930
• Composites whose prime factorization in base 5 is an anagram of the number in base 5.at n=25A260049
• Numbers k such that (2*10^k - 23)/3 is prime.at n=21A293000
• Smallest number having exactly n divisors ending with 3 or 7.at n=14A331082
• Numbers that are the sum of four third powers in eight or more ways.at n=35A345152
• Numbers that are the sum of four third powers in exactly eight ways.at n=23A345153
• G.f. A(x) satisfies: [x^(n+1)] (1+x - x^2*A(x))^(n*(2*n+1)) = 0, for n >= 0.at n=4A352409
• Odd numbers m such that there exists no k for which the denominator of d(k)/k = m where d(k) is the number of divisors of k (A000005).at n=39A353320
• Number of integer partitions of n that cannot be partitioned into a set (or multiset) of sets with distinct sums.at n=47A381990
• Numbers k such that, for some m >= 1, k is the product of the sum of prime factors of k, counted with multiplicity, and the sum of the m-th powers of the digits of k.at n=5A389796
• a(n) = Sum_{k=0..floor(n/4)} 2^k * 3^(n-3*k) * binomial(k+2,2) * binomial(n-2*k,k) * binomial(n-3*k,k).at n=8A391986