21349

Appears in sequences

• Consider all ways of writing a number as p+2m^2 where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number.at n=16A016067
• Strong pseudoprimes to base 24.at n=11A020250
• Strong pseudoprimes to base 54.at n=13A020280
• Strong pseudoprimes to base 57.at n=16A020283
• Numbers k such that the continued fraction for sqrt(k) has period 35.at n=38A020374
• Smallest integer that can be expressed as p+2m^2 in more ways than any smaller number, where m >= 0 and p = 1 or prime.at n=37A055202
• Number of singular points on n-th order Chmutov surface.at n=37A057870
• Nonprimes k such that k divides 3^(k-1) - 2^(k-1).at n=37A073631
• Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square.at n=20A088319
• a(1) = 1 then the least multiple of odd numbers not odd multiples of 5, (3,7,9,11,13,17,19,21,23,27,29,...) such that every partial concatenation is noncomposite.at n=14A110433
• Least binary palindrome (cf. A006995) with n binary digits such that the number of contiguous palindromic bit patterns is minimal.at n=14A217097
• Binary palindromes (cf. A006995) such that the number of contiguous palindromic bit patterns is minimal (for a given number of places).at n=34A217099
• Composites whose prime factorization in base 12 is an anagram of the number in base 12.at n=8A260055
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 758", based on the 5-celled von Neumann neighborhood.at n=32A273490
• a(n) = A273059(4n+3).at n=25A275919
• 34-gonal numbers: a(n) = n*(32*n-30)/2.at n=37A282854
• Numbers k such that 3^(k-1) == 2^(k-1) !== 1 (mod k).at n=26A285300
• Odd numbers k such that A064989(k) is in A340151.at n=29A340091
• Number of distinct integers of the form (x^n + y^n) mod n^3.at n=36A366419