29461
domain: N
Appears in sequences
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 1, -1), (1, 0, -1), (1, 0, 1)}.at n=9A149319
- Numbers n such that n*2^2203 - 1 is prime.at n=35A265503
- Number of length-(n+1) 0..4 arrays with new repeated values introduced in sequential order starting with zero.at n=5A268257
- T(n,k)=Number of length-(n+1) 0..k arrays with new repeated values introduced in sequential order starting with zero.at n=41A268261
- Number of length-(6+1) 0..n arrays with new repeated values introduced in sequential order starting with zero.at n=3A268265
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f.: exp(Product_{j=1..n} 1/(1-x^j) - 1).at n=61A294212
- E.g.f.: exp(1/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)) - 1).at n=6A294215