42288
domain: N
Appears in sequences
- a(n) = Sum_{k=0..n} (k+1) * A026736(n,n-k).at n=12A027220
- Number of necklaces with 7 black beads and n-7 white beads.at n=21A032192
- Molien series for complete weight enumerators of self-dual codes over GF(9).at n=14A092071
- G.f. satisfies: A(x) = 1/(1 + x*A(x^2)) and also the continued fraction: 1 + x*A(x^3) = [1; 1/x, 1/x^2, 1/x^4, 1/x^8, ..., 1/x^(2^(n-1)), ...].at n=49A101912
- Determinants of 5 X 5 matrices consisting of 25 consecutive primes.at n=29A118815
- Number of permutations in S_n avoiding {bar 2}413{bar 5} (i.e., every occurrence of 413 is contained in an occurrence of a 24135).at n=10A137551
- Duplicate of A137551.at n=9A160701
- Number A(n,k) of necklaces with n white beads and k*n black beads; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=62A261494
- Number of necklaces with n white beads and 3*n black beads.at n=7A261497
- Numbers k such that Bernoulli number B_{k} has denominator 46410.at n=10A295590
- A(n,k) is (1/k) times the number of n-member subsets of [k*n] whose elements sum to a multiple of n; square array A(n,k), n>=1, k>=1, read by antidiagonals.at n=51A309148
- (1/4) times the number of n-member subsets of [4n] whose elements sum to a multiple of n.at n=6A309183