25137

Appears in sequences

• Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=18A061364
• Pairs of deficient numbers having the same value of sigma(k)/k in the order that they are found.at n=24A211680
• Deficient numbers n having a companion m > n such that sigma(n)/n = sigma(m)/m.at n=12A212608
• Pairs of primitive deficient numbers having the same value of sigma(k)/k, listed by increasing value of the larger of the two k values.at n=4A212610
• Primitive deficient numbers n having a companion m > n such that sigma(n)/n = sigma(m)/m (ordered by increasing (smallest possible) m).at n=2A212611
• a(n) = Sum_{i=0..n} digsum_9(i)^3, where digsum_9(i) = A053830(i).at n=54A231686
• 4*(n + 7)^3 - 27*(n + 7)^2 = (4*n +1)*(n+7)^2.at n=14A245033
• Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 8 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 8.at n=0A252614
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 8 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 8.at n=21A252615
• Number of (1+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 8 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 8.at n=6A252616
• Numbers k such that squarefree part of sigma(k) is equal to squarefree part of 2*k.at n=13A331752
• a(n) is the smallest number which can be represented as the sum of n distinct positive cubes in exactly 2 ways, or -1 if no such number exists.at n=15A374417