27702
domain: N
Appears in sequences
- Theta series of tensor cube of A_2 lattice (dimension 8, det 3^12).at n=48A033688
- Numbers having four 6's in base 8.at n=12A043448
- Smallest multiple of n^2 beginning with n.at n=26A078210
- Binomial transform of Chebyshev polynomial coefficients A001793.at n=7A081278
- Square array of binomial transforms of Chebyshev polynomial coefficients.at n=52A081281
- Numbers k that divide A005554(k) (the sum of consecutive Motzkin numbers).at n=39A081741
- Absolute value of the difference between largest square and largest cube each with n decimal digits.at n=5A119273
- Coefficient of x^2 in the polynomial (x-p(n))*(x-p(n+1))*(x-p(n+2))*(x-p(n+3)), where p(k) is the k-th prime.at n=17A127348
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=10.at n=34A135195
- a(n)=sum{k=0..floor(n/2), C(n,2k)*A000108(floor(k/2))}. Inverse binomial transform is aeration of doubled Catalan numbers.at n=15A157021
- Triangle S(n,k) by rows: coefficients of 3^((n-1)/2)*(x^(1/3)*d/dx)^n when n=1,3,5,...at n=26A223525
- Smallest sets of 7 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=13A228964
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) < number of distinct parts of p.at n=43A241818
- Expansion of Product_{k>0} (1 - q^(3*k))^5/((1 - q^k)^3*(1 - q^(6*k))^2).at n=19A293423
- Indices of records in A347113.at n=31A347308
- Expansion of g.f. A(x) satisfying theta_4(x) = Sum_{n=-oo..+oo} x^n * (2*A(x) - x^n)^(n-1) where theta_4(x) = Sum_{n=-oo..+oo} (-1)^n * x^(n^2) is a Jacobi theta function.at n=6A363574