85480
domain: N
Appears in sequences
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=32A054234
- Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive).at n=44A074814
- Number of arrangements of n+1 nonzero numbers x(i) in -n..n with the sum of floor(x(i)/x(i+1)) equal to zero.at n=4A189490
- Number of arrangements of n+1 nonzero numbers x(i) in -5..5 with the sum of floor(x(i)/x(i+1)) equal to zero.at n=4A189494
- T(n,k)=Number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of floor(x(i)/x(i+1)) equal to zero.at n=40A189498
- Number of arrangements of 6 nonzero numbers x(i) in -n..n with the sum of floor(x(i)/x(i+1)) equal to zero.at n=4A189502
- Number of arrays of length n that are sums of 4 consecutive elements of length n+3 permutations of 0..n+2, and no two consecutive rises or falls in the latter permutation.at n=6A229714
- T(n,k) = number of arrays of length n that are sums of k consecutive elements of length n+k-1 permutations of 0..n+k-2, and no two consecutive rises or falls in the latter permutation.at n=51A229717
- a(n) = Sum_k k*A333274(n,k).at n=18A333276