254475

Appears in sequences

• Fermat coefficients.at n=11A000973
• a(n) = 3*binomial(4*n-1, n-1)/(4*n-1).at n=7A006632
• a(n) = floor(binomial(n,7)/8).at n=30A011844
• Number of independent vertex sets in the n-hypercube graph Q_n.at n=5A027624
• Irreducible Euler sums of weight 8 and depth 10+2n.at n=22A031164
• Number of necklaces with 8 black beads and n-8 white beads.at n=23A032193
• Schoenheim bound L_1(n,8,7).at n=22A036835
• a(n) = ceiling(binomial(n,8)/n).at n=30A053731
• A sequence related to numeric partitions and Fermat Coefficients.at n=23A059251
• Third level generalization of Catalan triangle (0th level is Pascal's triangle A007318; first level is Catalan triangle A009766; 2nd level is A069269).at n=52A069270
• Length of lists created by n substitutions k -> Range[k+1,1,-3] starting with {1}, counting down from k+1 to 1 step -3.at n=22A084080
• a(3n+k) = (k+1)*binomial(4n+k, n)/(3n+k+1), where k is n reduced mod 3.at n=23A124753
• Numbers k such that k and k^2 use only the digits 2, 4, 5, 6 and 7.at n=56A137094
• Triangle, read by rows, defined by: T(n,k) = 1/((k+1)n-1) binomial((k+1)n-1,n) for n,k>0.at n=47A162382
• 3-parking triangle T(r, i, 3) read by rows: T(r, i, k) = (r + 1)^(i-1)*binomial(k*(r + 1) + r - i - 1, r - i) with k = 3 and 0 <= i <= r.at n=28A329059
• a(n) = denominator of Sum_{1 <= i < j <= d(n)} 1/(d_j - d_i), sum over ordered pairs of divisors of n, where d(n) is the number of divisors of n.at n=29A330078
• Triangle read by rows. T(n,k) = Sum_{j=0..k} binomial(k-j+2, 2)*T(n-1, j), for n>=0, 0<=k<=n, with T(0,0)=1 and T(n,n)=0 for n>0.at n=43A339350
• Number of n element multisets of length 3 vectors over GF(2) that sum to zero.at n=23A362906
• Expansion of g.f. A(x) satisfying A(x) = 1 + x*(3*A(x)^2 + A(-x)^2)/4.at n=15A369082
• Number of subsets of 8 integers between 1 and n such that their sum is 0 modulo n.at n=22A381291