35333

Appears in sequences

• Divisors of 2^44 - 1.at n=31A003549
• a(n) = (2*n+1)*(9*n+1).at n=44A033573
• Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=21A050217
• Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 19.at n=19A051984
• Sarrus numbers k such that k-1 and k+1 have the same number of prime divisors (counted with multiplicity).at n=3A086806
• Near-repdigit semiprimes with 3 as repeated digit.at n=33A105984
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, -1), (1, -1, -1), (1, 0, 1)}.at n=10A148653
• Increasing gaps between 2-pseudoprimes (lower end).at n=10A175736
• Pseudoprimes to base 2 of the form 4k+1.at n=40A178723
• Semiprimes p*q with p < q and 2^p (mod q) == 2^q (mod p).at n=32A179839
• Fermat pseudoprimes to base 2 with two prime factors.at n=21A214305
• Fermat pseudoprimes to base 2 which are not Euler pseudoprimes to base 2.at n=20A227136
• Sarrus numbers (A001567) that are the average of two consecutive primes.at n=5A265684
• Composite numbers n such that 2^lpf(n) == 2 (mod n), where lpf(n) = A020639(n).at n=33A276733
• Numbers k with digits 3 and 5 only.at n=38A284379
• Composite integers k such that 2^d == 2^(k/d) (mod k) for all d|k.at n=23A291601
• Numbers p_1*p_2*...*p_k such that (2^p_1-1)*(2^p_2-1)*...*(2^p_k-1) is a Poulet number (A001567), where p_i are primes and k >= 2.at n=23A291617
• Numbers k > 1 such that 2^k == 2 (mod k) and gcd(k, 3^k - 3) = 1.at n=0A300762
• Numbers k such that 2^(k-1) == 1 (mod k) and lpf(k)-1 does not divide k-1.at n=3A316906
• Numbers k such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.at n=2A316907