34782
domain: N
Appears in sequences
- a(n) = (7*n+3)*(7*n+5)*(7*n+6).at n=4A001561
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/32 ).at n=34A011942
- Theta series of 17-dimensional lattice Q_17(6)^{+3}.at n=8A015160
- Theta series of 17-dimensional lattice Q_17(6)^{+6}.at n=32A015161
- a(n) = rad(n*(n+1)*(n+2)*(n+3)).at n=30A078638
- Squarefree oblong (pronic) numbers having an odd number of prime factors.at n=27A098827
- Integers that do not have a partition into a sum of an odd square and two (not necessarily distinct) triangular numbers.at n=48A191764
- Numbers k such that the sum of the divisors of k and the sum of the distinct prime divisors of k are both a square.at n=28A194196
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=21A262849
- Number of (1+2)X(n+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=6A262850
- Number of (n+1) X (3+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=7A262912
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=52A262917
- Oblong numbers that are the sum of 2 successive primes.at n=41A298077
- a(n) is the number of partitions of n with Durfee square of size <= 4.at n=40A330642
- Triangular array read by rows. T(n,k) is the number of n X n matrices over GF(2) with minimal polynomial of degree k, n >= 0, 0 <= k <= n.at n=17A347010
- Oblong numbers which are products of five distinct primes.at n=11A359304