30350
domain: N
Appears in sequences
- Self-convolution equals A183160.at n=7A183161
- Total number of zero digits in primes less than 10^n.at n=5A231411
- Number of (n+1) X (2+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=25A250723
- For any n > 0, if A006666(n) >= 0, then a(n) = Sum_{i = 0..A006666(n)-1} 2^i * [T^i(n) == 0 (mod 2)] (where [] is an Iverson bracket and T^i denotes the i-th iterate of the Collatz function A014682); otherwise a(n) = -1.at n=36A304715
- a(n) = 1*2*3 + 4*5*6 + 7*8*9 + 10*11*12 + 13*14*15 + 16*17*18 + ... + (up to n).at n=25A319014
- a(n) = coefficient of x^n*y^n in Product_{n>=1} (1 - (x^n + y^n)).at n=113A322213
- Expansion of 1 / (1 + Sum_{k>=1} mu(k)^2 * x^k).at n=52A329099