29428

Appears in sequences

• a(n) is the number of zeros needed to write the integers 1 through Fibonacci(n).at n=24A155881
• Number of nX2 binary arrays with the number of 0-1 adjacencies equal to the number of 0-0 adjacencies.at n=9A183257
• Expansion of g.f.: exp( Sum_{n>=1} A002203(n)^2 * x^n/n ) where A002203 are the companion Pell numbers.at n=6A204062
• Subsequence of lesser of 2 terms of A095301 that are 2 apart.at n=9A248083
• G.f. A(x) satisfies: A(x) = 1 - x * A(x/(1 - x)) / (1 - x)^5.at n=10A346060
• Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 - x^2/2*(exp(x) - 1)) ).at n=8A370991