280000
domain: N
Appears in sequences
- Numbers n such that the squarefree kernel of n is equal to the number of divisors of n.at n=27A070226
- Numbers divisible by the 4th power of the sum of their digits in base 10.at n=21A072083
- Signed triangle used to compute column sequences of array A078741 ((3,3)-Stirling2).at n=31A090219
- E.g.f.: A(x,y) = LambertW(x*y*exp(x))/(x*y*exp(x)), as a triangle of coefficients T(n,k) = [x^n*y^k/n! ] A(x,y), read by rows.at n=32A161628
- Totally multiplicative sequence with a(p) = 5*(p+2) for prime p.at n=39A167306
- Integers that can be generated with a C/C++ expression that is two or more characters shorter than their decimal representation.at n=27A168651
- Triangular array read by rows: T(n,k) is the number of forests of rooted labeled trees such that the vertex labeled with 1 is in a component (rooted tree) of size k, n>=1, 1<=k<=n.at n=31A232055
- a(n) is the least number with exactly n divisors of the form 3*k+2.at n=34A364583