49981

Appears in sequences

• Numerators of coefficients for central differences M_{4}^(2*n).at n=14A002675
• Numerators of the Taylor coefficients of (e^x-1)^2.at n=29A002678
• Cyclotomic polynomials at x=4.at n=15A019322
• Strong pseudoprimes to base 4.at n=20A020230
• Strong pseudoprimes to base 75.at n=32A020301
• Multiplicity of highest weight (or singular) vectors associated with character chi_116 of Monster module.at n=41A034504
• Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=24A050217
• a(n) = n^8 - n^7 + n^5 - n^4 + n^3 - n + 1.at n=4A060889
• Zsigmondy numbers for a = 4, b = 1: Zs(n, 4, 1) is the greatest divisor of 4^n - 1^n (A024036) that is relatively prime to 4^m - 1^m for all positive integers m < n.at n=14A064080
• Expansion of (1-x)/(1+x+2*x^2-x^3).at n=24A078049
• Brilliant Sarrus numbers.at n=7A086837
• Having specified two initial terms, the "Half-Fibonacci" sequence proceeds like the Fibonacci sequence, except that the terms are halved before being added if they are even.at n=40A120424
• a(n) = (Sum_{k=1..A047380(n)} k^6) / (Sum_{k=1..A047380(n)} k^2).at n=10A133180
• a(n) = 163 + 1053*n + 2520*n^2 + 2646*n^3 + 1029*n^4.at n=2A134160
• a(0) = 1, a(1) = 3; a(n+2) = (a(n+1) + a(n))/2 if 2 divides (a(n+1) + a(n)), a(n+2) = a(n+1) + a(n) otherwise.at n=40A151749
• Number of ways to place zero or more nonadjacent 2,1 3,0 3,1 3,3 4,2 4,3 5,1 5,2 polyhexes in any orientation on a planar nXnXn triangular grid.at n=8A155441
• Nonprimes k such that 9*k divides 2^(k-1) - 1.at n=41A175521
• Pseudoprimes to base 2 of the form 4k+1.at n=46A178723
• Semiprimes p*q with p < q and 2^p (mod q) == 2^q (mod p).at n=39A179839
• Fermat pseudoprimes to base 2 with two prime factors.at n=24A214305