115356

Appears in sequences

• Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) =(b(n)*x + a(n))/(c(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.at n=11A075828
• Ascending descending base exponent transform of odd numbers A005408.at n=5A113170
• Number of n X 1 0..3 arrays with no element equal to the sum modulo 4 of elements to its left or elements above it.at n=13A238768
• Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the consecutive step patterns 010 or 101, where 1=up and 0=down; triangle T(n,k), n >= 0, k = max(0, n-3), read by rows.at n=37A295987
• a(n) = Sum_{k=0..floor(n/2)} binomial(k+2,2) * binomial(2*k,2*n-4*k).at n=17A382494