23662

Appears in sequences

• a(n) = A026568(n,n-1), also a(n) = number of integer strings s(0),...,s(n) counted by A026568 such that s(n)=1.at n=12A026570
• a(n+3) = a(n+2) + 3*a(n+1) + a(n).at n=14A111352
• G.f. A(x) satisfies 0 = A(0) and 0 = f(x, A(x)) where f(u, v) = (v - u) * (1 + u*v) - v * (v + u).at n=9A245734
• The number of digits in max(a,b,c), where a, b, and c are the smallest positive integer solutions to a/(b+c) + b/(a+c) + c/(a+b) = A283564(n).at n=17A371846
• G.f. A(x) satisfies: A( A(x)^3 - A(x)^4 ) = x*A(x)^2.at n=11A380054