3435973837

Appears in sequences

• Expansion of (1-x)/(1-2*x+x^2-2*x^3).at n=33A007909
• Expansion of 1/((1-2*x)*(1+x^2)).at n=32A007910
• a(n) = (1 - (-4)^n)/5.at n=16A014985
• a(n) = 3*a(n-1) + 4*a(n-2), a(0) = 0, a(1) = 1.at n=17A015521
• Cyclotomic polynomials at x=-4.at n=17A020503
• a(n) = (lcm_{k=0..n} (2^k + 1))/(lcm_{k=0..n-1} (2^k + 1)).at n=33A066845
• a(n) = sigma_4(n^4)/sigma_2(n^4).at n=15A077457
• Record values in A091023.at n=16A091052
• 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=16A113876
• a(n) = 2*a(n-1) - a(n-2) + 2*a(n-3).at n=32A133190
• a(n) = 3*a(n-1) + 4*a(n-2) - a(n-3) + 3*a(n-4) + 4*a(n-5).at n=16A135343
• Number of n-step one-sided prudent walks, avoiding single west steps and single east steps.at n=32A190569
• Binary XOR of (2^k - (-1)^k)/3 as k varies from 1 to n.at n=32A199403
• Expansion of -x^2*(x^3+x-1) / ((x-1)*(x+1)*(2*x-1)*(x^2+1)).at n=34A256494
• 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=31A262267
• Numbers of the form (2^(2p) + 1)/5, where p is a prime > 5.at n=3A293626
• a(n) = (4^(2*n+1) + 1) / 5.at n=8A299960
• 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=43A340441
• Smallest a(n) so that division by n can be performed by floor(x/n) = floor(x*a(n)/2^A346496(n)) for any 0 <= x < 2^32.at n=4A346495
• Smallest a(n) so that division by n can be performed by floor(x/n) = floor(x*a(n)/2^A346496(n)) for any 0 <= x < 2^32.at n=9A346495