28490

Appears in sequences

• a(n) is the difference between the largest and smallest integer solutions to n=x/pi(x), where pi(x) = A000720(x).at n=35A087236
• Number of reduced magic borders of order n (these extend magic squares of order n-2 to order n).at n=5A091990
• Number of -7..7 arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero.at n=3A199942
• T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero.at n=48A199943
• Number of -n..n arrays x(0..3) of 4 elements with zeroth through 3rd differences all nonzero.at n=6A199945
• Rademacher's partition formula extended to half-integers. a(n) = round(sqrt(48) * (cosh(h(n)) - sinh(h(n))/h(n)) / (24*n + 11)) where h(n) = sqrt(24*n + 11)*(Pi/6).at n=38A376876
• Products of 5 distinct primes that are sandwiched between squarefree semiprime numbers.at n=25A376949