30102
domain: N
Appears in sequences
- Numbers k whose decimal representation, read as a base-19 value and divided by k, yields an integer.at n=16A032569
- Product of a prime and the following number.at n=39A036690
- Squarefree numbers k with largest prime factor = floor(sqrt(k)).at n=28A071311
- Maximum of A073830(k) for k between A001359(n) and A001359(n+1).at n=11A073831
- a(n) =(A001359[n]^2-1)/2.at n=20A117849
- a(n) = number of conjugacy classes in PSL_3(prime(n)).at n=39A124679
- a(n) = (4*n+1)*(4*n+2) = (4*n+2)!/(4*n)!.at n=43A157870
- Trisection of A107926: The least number k such that there are primes p and q with p - q = 6*n+4, p + q = k, and p the least such prime >= k/2.at n=40A234956
- "Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t".at n=26A284515
- Maximum number of 6 sphinx tile shapes in a sphinx tiled hexagon of order n.at n=28A291582
- Number of permutations of [n] avoiding {4231, 2134, 1243}.at n=13A294718
- Expansion of Product_{k>=1} (1 + x^k)^(k*(k+1)*(4*k-1)/6).at n=9A294843
- Oblong numbers which are products of four distinct primes.at n=31A358988
- Numbers k such that A003415(k) >= A276086(k) and gcd(k, A003415(k)) = gcd(k, A276086(k)), where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.at n=32A369959
- Numbers k such that (A276086(k)/s)^s >= k^(s-1) and A276086(k) <= A003415(k), where A003415 is the arithmetic derivative, A276086 is the primorial base exp-function, and s = bigomega(k).at n=35A370128
- Numbers k such that A322582(k) <= A276086(k) <= A348507(k).at n=39A392602