31251

Appears in sequences

• Numbers that are the sum of 3 nonzero 6th powers.at n=30A003359
• a(n) = 2*n^3 + 1.at n=25A033562
• a(n+3) = floor( ( a(n) + 2*a(n+1) + 3*a(n+2) )/4 ), with a(0), a(1), a(2) equal to 0, 1, 2.at n=43A074732
• a(3n) = 3a(3n-1)-3a(3n-2)+2a(3n-3), a(3n+1) = 3a(3n)-3a(3n-1)+2a(3n-2), a(3n+2) = 3a(3n+1)-3a(3n), a(0) = 0, a(1) = 1, a(2) = 2.at n=21A131761
• a(n) = 50*n^2 + 1.at n=24A157916
• a(n) = 2*5^n+1.at n=6A199212
• Least number k such that k^2-1 is the sum of two nonzero squares in exactly n ways.at n=13A274567
• G.f.: Product_{m>0} (1 + x^m + 2*x^(2*m) + 3*x^(3*m)).at n=35A290269
• Numbers k such that there is no prime p and index j > k such that A002182(j) = p * A002182(k).at n=11A309042
• Triangle read by rows: T(n,k) = (n+2) * (Sum_{i=k..n} i!) / ((k+2) * k!) for 0 <= k <= n with T(i,j) = 0 if j < 0 or i < j.at n=49A344381
• Numbers that are the sum of seven fourth powers in eight or more ways.at n=10A345574
• Numbers that are the sum of seven fourth powers in nine or more ways.at n=4A345575
• Numbers that are the sum of seven fourth powers in ten or more ways.at n=0A345576
• Numbers that are the sum of seven fourth powers in exactly ten ways.at n=0A345832