18276

Appears in sequences

• Number of Costas arrays of order n, counting rotations and flips as distinct.at n=16A008404
• Numbers k such that 4^k - 3 is prime.at n=30A059266
• a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 6) so far).at n=29A060733
• Generalized Bell numbers.at n=5A061683
• Numbers k such that the three second-degree cyclotomic polynomials x^2 + 1, x^2 - x + 1 and x^2 + x + 1 are simultaneously prime when evaluated at x=k.at n=14A087277
• Number of permutations of 1..n with all differences of elements separated by distances 1 through 8 being respectively unique.at n=16A170814
• Number of permutations of 1..n with all differences of elements separated by distances 1 through 9 being respectively unique.at n=16A170815
• a(n) = Sum_{k=1..n} (k+2)!/k! = Sum_{k=1..n} (k+2)*(k+1).at n=36A180118
• a(n) is the number of terms in the expansion of (x-y)(x^3-y^3)*(x^6-y^6)*(x^10-y^10)*...*(x^T_i-y^T_i), where T_i is the i-th triangular number.at n=46A222028
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.at n=49A267278
• Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.at n=4A267280
• Number of 5 X n arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 5 and the upper left element equal to 0.at n=5A267285
• a(n) = 288*2^n - 156.at n=6A278128
• a(1) = 27846; thereafter a(n+1) = a(n) # n, where # is an operation that cycles through division, addition, subtraction and multiplication.at n=13A327962
• Main diagonal of A332361.at n=19A332362
• Expansion of e.g.f. ( (1/x) * Series_Reversion( x * exp(-2*x * cosh(x)) ) )^(1/2).at n=5A381444
• Centered pentagonal numbers that are abundant.at n=14A382696