27552

Appears in sequences

• Almost trivalent maps.at n=3A002008
• Expansion of e.g.f. arctan(cos(x) * log(x+1)).at n=8A012469
• Theta series of 8-dimensional strongly 6-modular lattice O(6) with minimal norm 3.at n=41A029720
• Numbers k such that sigma (x) = k has exactly 11 solutions.at n=32A060678
• a(n) equals the square of the n-th partial sum added to twice the n-th partial sum of the squares, divided by a(n-1), for all n>=1, with a(0)=1, a(1)=1.at n=8A088131
• Number of permutations of floor(i*6/5), i=0..n-1, with all sums of 4 adjacent terms unique.at n=7A152338
• Scaled coefficients of the M. O. Rubinstein polynomials.at n=23A153359
• Sum of divisors of the product of two consecutive primes.at n=37A180617
• Expansion of 1/(1 - x - x^2 - x^4 + x^5 + x^7).at n=21A260710
• a(n) = prime(n)^3 - prime(n) * prime(n^2).at n=12A291542
• Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=8A300884
• Numbers k such that k^2 | A038199(k).at n=36A317475
• Numbers k for which A306927(k) [= A001615(k)-k] is a multiple of A344705(k) [= A001615(k)-A001065(k)], and their quotient is nonnegative.at n=35A344700
• Number of integer compositions of n into parts that are alternately unequal and equal.at n=34A357644
• a(n) = Sum_{k=0..floor(n/3)} 2^k * |Stirling1(n,3*k)|.at n=8A357831
• Number of binary words of length n not containing the substrings 0000, 0001, 0011, 0111.at n=22A368430
• Expansion of e.g.f. 1/(1 - sinh(x))^3.at n=6A381210
• Number of Hamiltonian paths in the n-flower graph.at n=6A387456
• a(n) is the least number k such that the equation phi(x) = k has exactly n solutions and the arithmetic mean of these solutions is an integer, or -1 if no such number exists.at n=26A389860