214748365

Appears in sequences

• Expansion of (1-x)/(1-2*x+x^2-2*x^3).at n=29A007909
• Expansion of 1/((1-2*x)*(1+x^2)).at n=28A007910
• a(n) = (1 - (-4)^n)/5.at n=14A014985
• a(n) = 3*a(n-1) + 4*a(n-2), a(0) = 0, a(1) = 1.at n=15A015521
• Triangular array read by rows: row s contains integers of the form (2^s+1)/(2^r+1) in order of increasing r <= s-1.at n=33A079665
• Record values in A091023.at n=14A091052
• a(n) = a(n-1) + 2^(k(n)), where k(n) is the n-th term of the sequence formed by k(1)=0 together with the numbers A042964.at n=14A113876
• a(n) = 2*a(n-1) - a(n-2) + 2*a(n-3).at n=28A133190
• a(n) = 3*a(n-1) + 4*a(n-2) - a(n-3) + 3*a(n-4) + 4*a(n-5).at n=14A135345
• Number of n-step one-sided prudent walks, avoiding single west steps and single east steps.at n=28A190569
• Binary XOR of (2^k - (-1)^k)/3 as k varies from 1 to n.at n=28A199403
• Expansion of -x^2*(x^3+x-1) / ((x-1)*(x+1)*(2*x-1)*(x^2+1)).at n=30A256494
• Number of (n+2) X (1+2) 0..1 arrays with each row and column divisible by 5, read as a binary number with top and left being the most significant bits.at n=27A262267
• a(n) = (4^(2*n+1) + 1) / 5.at n=7A299960
• Square array, read by ascending antidiagonals, where row n gives all odd solutions k > 1 and n > 0 to A000120(2*n+1) = A000120((2*n+1)*k), A000120 is the Hamming weight.at n=34A340441
• Array T(n,m) = (2^(m*(2*n+1))+1)/(2^m+1) read by antidiagonals.at n=34A360967
• Records in A385485.at n=18A385487