38798
domain: N
Appears in sequences
- In base 3: smallest number that requires n Reverse and Add! steps to reach a palindrome.at n=24A077403
- G.f. A(x) satisfies A(x) = 1 + x*A(x)^4 * A(x*A(x)^4)^4.at n=5A120975
- Number of weighted lattice paths in L_n having no (1,0)-steps at level 0. The members of L_n are paths of weight n that start at (0,0), end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=15A182889
- Number of free poly-IH8-tiles (holes allowed) with n cells.at n=8A197550
- Number of (w,x,y) with all terms in {0,...,n} and 2*|w-x| > max(w,x,y) - min(w,x,y).at n=38A213045
- Number of free poly-IH9-tiles (holes allowed) with n cells.at n=8A213950
- a(n) = Sum_{k=1..n} k^floor(n/k).at n=26A345100
- Right border of A348575.at n=7A349742