cp's OEIS Frontend

If h_3(n) is the multiplicative order of 3 modulo n, r_3(n) is the number of cyclotomic cosets of 3 modulo n then, by the definition, n is an overpseudoprime to base 3 if h_3(n)*r_3(n)+1=n. These numbers are in A020229.

In particular, if n is squarefree such that its prime factorization is n=p_1*...*p_k, then n is overpseudoprime of base 3 iff h_3(p_1)=...=h_3(p_k).

Restricted growth sequence transform of function f defined as f(n) = A006694((n-1)/2) when n is an odd prime, otherwise -n.

For all i, j:

a(i) = a(j) => A305801(i) = A305801(j),

a(i) = a(j) => A319351(i) = A319351(j).

C_i = {i, 2i, 4i, ... } reduced mod e.

The zero terms are of a special interest. Indeed, since for any odd prime p, A137576((p-1)/2)=p, then it is natural to call "overpseudoprimes" those Poulet pseudoprimes A001567(n) for which a(n)=0.

Theorem. A squarefree composite number m = p_1*p_2*...*p_k is an overpseudoprime if and only if A002326((p_1-1)/2) = A002326((p_2-1)/2) = ... = A002326((p_k-1)/2). Moreover, every overpseudoprime is in A001262.

Note that in A001262 there exist terms which are not squarefree. The first is A001262(52) = 1194649 = 1093^2.

It can be shown that if an overpseudoprime is not a multiple of the square of a Wieferich prime (see A001220) then it is squarefree. Also all squares of Wieferich primes are overpseudoprimes.

Let f be defined as in A159885. Then a(n) is the least k such that either f^k(2n+1))<2n+1 or A000120(f^k(2n+1)) < A000120(2n+1) or A006694((f^k(2n+1)-1)/2) < A006694(n).

In connection with A160198, A160267, A160322 we pose a new (3x+1)-problem: does there exist a finite number of sequences A_i(n), i=1,...,T, such that: 1) A_i(0)=0 and A_i(n)>0 for n>=1; 2) if B_i(n) denotes the least k for which A_i(n)>A_i((f^k(2n+1)-1)/2), then B(n)=min_{i=1,...,T}B_i(n)=1 for every n>=1? Note that this problem is weaker than (3x+1)-Collatz problem. Indeed, if the Collatz conjecture is true, then there exist nonnegative sequences A(n) for which A(0)=0 and A(n)>A((f(2n+1)-1)/2) for every n>=1 (see A160348). - Vladimir Shevelev, May 15 2009

If h_2(n) is the multiplicative order of 2 modulo n, r_2(n) is the number of cyclotomic cosets of 2 modulo n then, by the definition, n is an overpseudoprime to base 2 if h_2(n)*r_2(n)+1=n. These numbers are in A141232.

We call numbers {n,n+2} overpseudo-twin-primes to base 2 if each of them either prime or overpseudoprime to base 2, but no two are primes.

All prime powers p^k, k >= 1, are allotted to distinct equivalence classes according to the number of cyclotomic cosets of 2 mod p^k, while all other numbers occur in singular equivalence classes of their own.

Restricted growth sequence transform of function f defined as f(n) = A006694((n-1)/2) when n is an odd prime power > 1, otherwise -n.

For all i, j: a(i) = a(j) => A305976(i) = A305976(j). (See also A305975).

n >= 2 is a Josephus_k prime if and only if T(n,k) = 1; see A163782-A163800.