20415
domain: N
Appears in sequences
- a(n) = a(n-1) + 2*a(floor(n/2)) if n > 0, otherwise 1.at n=31A058039
- Integers n such that exactly 80 percent of the digits in base 2 are 1's.at n=45A163142
- Number of partitions p of n such that p contains fewer 1s than its conjugate.at n=40A240690
- a(n) = cpg(3, n) + cpg(4, n) + ... + cpg(n, n) where cpg(m, n) is the n-th m-th-order centered polygonal number.at n=17A257052
- Primitive values n such that the square with opposite corners (0,0) and (n,n) contains a point (x,y) with integer coordinates, with 0 < x,y < n, at an integer distance from three of the four corners.at n=27A260549
- Accumulation of the upper left triangle used in binomial transform of nonnegative integers.at n=10A276659
- a(n) = Sum_{i=1..n} (prime(i+1)-prime(i))*prime(n+1-i).at n=49A343531