Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141216
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141216 A137576((N-1)/2)-N, where N=A001567(n). +0
3
30, 320, 224, 240, 72, 360, 728, 0, 672, 216, 1320, 0, 0, 16, 5060, 60, 126, 10560, 216, 0, 3360, 2574, 150 (list; graph; listen)
OFFSET

1,1

COMMENT

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 square-free 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 square-free. 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.

REFERENCES

V. Shevelev, Overpseudoprimes, Mersenne Numbers and Wieferich Primes, arxiv.org/abs/0806.3412

CROSSREFS

Cf. A137576, A001567, A001262, A002326, A006694.

Sequence in context: A042750 A074994 A134287 this_sequence A159543 A006859 A107967

Adjacent sequences: A141213 A141214 A141215 this_sequence A141217 A141218 A141219

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Jun 14 2008, Jul 13 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research