99360

Appears in sequences

• Number of primitive polynomials of degree n over GF(5).at n=9A027741
• a(n) = n-th sept-factorial number divided by 2.at n=4A034829
• a(n) = p(n)/p(n-1), where p(n) = ( floor(n*log(n)) / Product_{j=2..pi(floor(n*log(n)))} prime(j) )!.at n=15A088301
• a(n) = 4*(3*n+2)*(2*n+1)*(n+2)*(n+1).at n=8A155122
• Array T(n,k) read by antidiagonals: number of primitive polynomials of degree k over GF(prime(n)).at n=63A158502
• Numbers with prime factorization pqr^3s^5.at n=9A190475
• The greedy sequence of real numbers at least 1 that do not contain any 3-term geometric progressions with integer ratio.at n=42A235054
• Generating function f(x)=(x+(x+(x+(x+(x+...)^5)^4)^3)^2)^1 is the limit as n->infinity of (f_1(x)=x, f_2(x)=x+x^2, f_3(x)=x+(x+x^3)^2, f_4(x)=x+(x+(x+x^4)^3)^2, ...).at n=31A276436
• Smallest integer such that the sum of its n smallest divisors is a Fibonacci number, or 0 if no such integer exists.at n=41A292467
• The sum of the sizes of the largest fixed points over all compositions of n.at n=16A335713
• Values of Euler's totient phi for A050498.at n=6A339883
• Numbers k such that k*A001414(k)+1 is the square of a prime.at n=39A343141
• a(n) = A351477(n) * FA where F is the Fermat point of a primitive integer-sided triangle ABC with A < B < C < 2*Pi/3 and FA + FB + FC = A336329(n).at n=20A351801
• Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 - x*exp(x^3/6)) ).at n=6A370931
• Numbers k that have a record number of divisors that have the same binary weight as k.at n=18A381069