48321

Appears in sequences

• Least sum of 4 distinct positive cubes in exactly n ways.at n=9A025421
• Triangle of a(n,k) = number of minimal covers of an n-set that cover k points of that set uniquely (n >= 1, k >= 1).at n=25A035347
• Row sums in A082259.at n=20A082261
• Partial sums of A005557.at n=11A115130
• Numbers n such that m=(n^2+1)/2, p=(m^2+1)/2 and q=(p^2+1)/2 are all prime.at n=25A188546
• Pairs of deficient numbers having the same value of sigma(k)/k in the order that they are found.at n=29A211680
• The larger companion to the deficient numbers in A212608.at n=14A212609
• E.g.f.: A(x) = exp( x/A(-x*A(x)^6)^2 ).at n=5A213111
• Numbers n such that n^1+n+1, n^2+n+1, n^3+n+1 and n^4+n+1 are all prime.at n=24A219117
• Triangular array read by rows. T(n,k) is the number of minimal covers of an n-set with exactly k points that are in more than one set of the cover, n>=0, 0<=k<=max(0,n-2).at n=19A282575
• Numbers that are the sum of four third powers in nine or more ways.at n=5A345146
• Numbers that are the sum of four third powers in eight or more ways.at n=24A345152
• Numbers that are the sum of four third powers in ten or more ways.at n=3A345155
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards, where T(n,k) = Sum_{j=1..n} j * floor(n/j)^k.at n=60A350106
• a(n) = Sum_{k=1..n} k * floor(n/k)^n.at n=5A350109