24682

Appears in sequences

• Fermat coefficients.at n=19A000970
• a(n) = 2*binomial(n,3).at n=43A007290
• Molien series for cyclic group of order 5.at n=39A008646
• a(n) = floor(C(n,4)/5).at n=43A011795
• a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=39A051170
• Expansion of (1-x)/(1-x-4x^2+2x^3).at n=13A052966
• a(n) = binomial(2*n,n) mod ((n+1)*(n+2)*(n+3)).at n=39A065345
• a(n) = Sum_{k=1..phi(n)-1} t(n,k)*t(n,k+1), where t(n,k) is the k-th positive integer which is coprime to n and phi(n) is the number of positive integers which are <= n and are coprime to n.at n=42A119584
• a(n) = 686*n - 14.at n=35A157363
• Number of increasing sequences of n integers x(1),...,x(n) with values in 1..3*n such that x(j) divides x(k) if j divides k.at n=21A180385
• G.f.: 1/(1 + x + 5*x^2 - x^3 + x^4).at n=13A199805
• a(n) = binomial(n+4,4)*gcd(n,5)/5.at n=39A234042
• a(n) = 8*binomial(9*n+8,n)/(9*n+8).at n=4A234513
• Size of the smallest conjugacy class of size greater than 1 of the alternating group of degree n.at n=39A237036
• a(n) = binomial(5*n+8, 4)/5 for n >= 0.at n=7A238473
• Number of partitions p of n such that (number of numbers of the form 3k in p) is a part of p.at n=40A241546
• Number of (3+1) X (n+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=22A258556
• a(n) = 2*A000447(n).at n=21A259110
• a(n) = 15*n^2 - 13*n.at n=41A263226
• Number of partitions of n into parts whose bitwise AND equals 0.at n=38A307435