26964

Appears in sequences

• Three-fold exponential convolution of Fibonacci numbers with themselves.at n=8A014336
• Expansion of 1/((1-x)*(1-2*x)*(1-3*x)*(1-6*x)).at n=5A021029
• Triangle of D-analogs of Stirling numbers of the 2nd kind.at n=64A039761
• Numbers k such that 263*2^k-1 is prime.at n=15A050890
• Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=5.at n=5A068022
• Triangle read by rows: number of circular permutations of [1..n] with k progressions of rise 1, distance 2 and length 3 (n >= 3, k >= 0).at n=40A216719
• Numbers n such that there exists an x!=n that makes {x,x,n} an amicable multiset.at n=7A259303
• a(n) = n*(n + 1)*(4*n - 1)/3.at n=27A268684
• Number of nonagons that can be formed with perimeter n.at n=46A288255
• Number of regions in a polygon whose boundary consists of n+2 equally spaced points around a semicircle and three equally spaced points along the diameter (a total of n+3 points). See Comments for precise definition.at n=26A333642
• Triangle read by rows: coefficients in expansion of another Asveld's polynomials Pi_j(x).at n=49A366133
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 5*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.at n=26A367299
• Terms of A319928 that are congruent to 4 modulo 8: Numbers k == 4 (mod 8) such that there is no other m such that (Z/mZ)* is isomorphic to (Z/kZ)*, where (Z/kZ)* is the multiplicative group of integers modulo k.at n=26A372755