104858

Appears in sequences

• Expansion of 1/((1-2*x)*(1+x^2)).at n=17A007910
• a(n) = ceiling(2^(n+1)/n).at n=19A053639
• Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 14 (most significant digit on right).at n=20A061943
• Expansion of (1-x)^(-1)/(1-x+2*x^3).at n=33A077870
• Expansion of (1-x)^(-1)/(1-x+2*x^3).at n=35A077870
• Expansion of (1-x)/(1-x+2*x^3).at n=38A078014
• Record values in A091023.at n=9A091052
• Number of rank-(n-2) simple matroids on S_n.at n=5A100728
• Numbers k such that A003313(k) = A003313(5*k).at n=29A116460
• a(n) = ceiling(4^n/n).at n=9A129788
• For a polynomial P(m) with rational coefficients, denote by lcmd(P) the LCM of the denominators of all its coefficients. Then a(n) = lcmd(Sum_{i=1..m} (i^n*Sum_{j=1..i} j^n))/ lcmd((Sum_{i=1..m} i^n)^2).at n=54A202533
• Number of inequivalent (mod D_4) ways to place 2 nonattacking knights on an n X n board.at n=34A243717
• Expansion of -x^2*(x^3+x-1) / ((x-1)*(x+1)*(2*x-1)*(x^2+1)).at n=19A256494
• 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=16A262267
• The length of the shortest prefix of the Thue-Morse word decomposable to not less than n palindromes.at n=13A320429
• a(n) = (4^(n+1) + (-1)^n + 5)/10.at n=9A363773