24928
domain: N
Appears in sequences
- Number of ways writing 2^n as unordered sums of 2 primes.at n=23A006307
- Expansion of (theta_3(z)*theta_3(19z) + theta_2(z)*theta_2(19z))^4.at n=33A028644
- a(n) = min{ m : sum_{n <= i <= m} 1/p_i > 1}, where p_i is the i-th prime = A000040(i).at n=24A092325
- Number of permutations of floor(i*3/2), i=0..n-1, with all sums of 3 adjacent terms unique.at n=7A152315
- Number of triangular nXnXn 0..3 arrays with all rows and diagonals having the same length having the same sum, with corners zero.at n=5A195800
- T(n,k)=Number of triangular nXnXn 0..k arrays with all rows and diagonals having the same length having the same sum, with corners zero.at n=33A195805
- Number of triangular of a 6X6X6 0..n arrays with all rows and diagonals having the same length having the same sum, with corners zero.at n=2A195807
- The number of integer partitions P of n such that either the length k of P is not a part or P has at least one part equal to 1 (or both).at n=38A229863
- Numbers which are representable as a sum of nineteen but no fewer consecutive nonnegative integers.at n=28A270303
- The E_6-Eulerian numbers.at n=3A273000
- Number of trees in all forests of (unlabeled) rooted identity trees with n vertices.at n=15A291532
- Solution of the complementary equation a(n) = 2*a(n-2) + b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=24A295067
- Lesser of a pair of amicable numbers k < m such that s(k) = m and s(m) = k, where s(k) = A162296(k) - k is the sum of aliquot divisors of k that have a square factor.at n=3A357495
- a(n) = Sum_{k=0..n-2} A205497(n, k) * (k mod 2).at n=10A373753