28226
domain: N
Appears in sequences
- Number of numbers of complexity n, i.e., that can be built from n ones using + and *, and require at least that many ones.at n=34A005421
- Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^((2*p-1)/2)) = (2*p-1)*(column p of T), or [T^((2*p-1)/2)](m,0) = (2*p-1)*T(p+m,p+1) for all m>=1 and p>=0.at n=40A105615
- Row sums of triangle A179901.at n=25A179902
- Smallest index k such that Fibonacci(k) contains Fibonacci(n) as a proper substring in decimal notation.at n=39A263400
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=9A317425
- Numbers k > 1 such that (3/2)^k sets a new record for closest fractional part to 1/2.at n=10A334264
- G.f. A(x) satisfies: A(x) = x + x^2 * exp(A(x) - A(-x^2)/2 + A(x^3)/3 - A(-x^4)/4 + ...).at n=18A345234