49051

Appears in sequences

• Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among triples.at n=25A015656
• Strong pseudoprimes to base 9.at n=36A020235
• Strong pseudoprimes to base 34.at n=18A020260
• Strong pseudoprimes to base 39.at n=21A020265
• Strong pseudoprimes to base 44.at n=30A020270
• Strong pseudoprimes to base 80.at n=21A020306
• Strong pseudoprimes to base 87.at n=23A020313
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 71 ones.at n=2A031839
• Number of solenoidal flows (flow in = flow out) in a 3 X 3 square array with integer velocities -n .. n.at n=9A068722
• Number of solenoidal flows (flow in = flow out) in an n X n square array with integer velocities in -9 .. 9.at n=2A068734
• Pentagonal numbers (A000326) that are also brilliant numbers (A078972).at n=8A113941
• Number of base 19 circular n-digit numbers with adjacent digits differing by 9 or less.at n=4A125476
• a(n) is the first pentagonal number that is nontrivially the sum of two pentagonal numbers of the type P(p) + P(p+n) (we always have P(k) = P(0) + P(k)).at n=6A133312
• Number of (w,x,y,z) with all terms in {1,...,n} and w > |x-y| + |y-z|.at n=19A212674
• Semiprimes of the form n*(3*n-1)/2.at n=22A245365
• Semiprimes of the form (4*n + 1)*(6*n + 1) = 24*n^2 + 10*n + 1.at n=9A255584
• Number of n X 3 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1's.at n=8A295546
• Numbers k > 2 such that 3^(k-1) == 1 (mod k) and gcd(k, 2^(k-1)-1) = 1.at n=3A306144
• Super pseudoprimes (or superpseudoprimes) to base 3: Fermat pseudoprimes to base 3 all of whose divisors that are larger than 1 are either primes or Fermat pseudoprimes to base 3.at n=26A328662