27555

Appears in sequences

• a(n) = (4*n+1)*(4*n+3).at n=41A001539
• T(2n,n-1), T given by A026659.at n=7A026661
• Triangle of number of permutations by length of shortest ascending run.at n=37A064315
• a(n) = Sum_{d|n} phi(d^4).at n=14A068970
• Smallest odd number k such that p(2m)-2p(m)=k has exactly n solutions (where p(m) = m-th prime).at n=16A069890
• a(n) = K_3(n) = Sum_{k>=0} A090285(3,k)*2^k*binomial(n,k). a(n) = (4*n^3+30*n^2+56*n+15)/3.at n=25A090294
• Least multiple of prime(n) containing only prime digits (2,3,5,7).at n=38A113590
• Number of permutations of [n] having a shortest ascending run of length 2.at n=9A185652
• a(n) = floor(n!^(1/3)).at n=16A214083
• a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is an oblong number.at n=32A214963
• Number of (2+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=30A250757
• Triangle read by rows: T(n,k) is the number of edge covers of the complete labeled graph on n nodes that are minimal and have exactly k edges, n>=2, 1<=k<=n-1.at n=53A281269
• Expansion of Product_{k>0} (1 + Sum_{m>0} x^(k*m!)).at n=49A304332
• Starts of runs of 3 consecutive anti-tau numbers (A046642).at n=36A341780
• a(n) = binomial(n,2)*(2^(n-2) - n).at n=7A342483
• Numbers m such that abs(K(m+1) - K(m)) = 1, where K(m) = A002034(m) is the Kempner function.at n=28A346211
• Number of distinct residues of x^n (mod n^5), x=0..n^5-1.at n=14A365102