The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A196202 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A196202

a(n) = 2^(prime(n)-1) mod prime(n)^2.
(history; published version)

#37 by Joerg Arndt at Thu Oct 24 02:20:22 EDT 2024

STATUS

proposed

approved

#36 by Jason Yuen at Thu Oct 24 01:29:12 EDT 2024

STATUS

editing

proposed

#35 by Jason Yuen at Thu Oct 24 01:28:53 EDT 2024

LINKS

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/WieferichPrime.html">Wieferich Prime</a>.

Wikipedia, <a href="httphttps://en.wikipedia.org/wiki/Wieferich_prime">Wieferich prime</a>.

#34 by Jason Yuen at Thu Oct 24 01:28:12 EDT 2024

EXAMPLE

A001220(1)=1093=A000040(183): a(183)=1, or a(A049084(A001220(1)))=1;

A001220(2)=3511=A000040(490): a(490)=1, or a(A049084(A001220(2)))=1.

STATUS

proposed

editing

#33 by Jason Yuen at Thu Oct 24 01:27:48 EDT 2024

STATUS

editing

proposed

#32 by Jason Yuen at Thu Oct 24 01:27:31 EDT 2024

COMMENTS

a(A049084(A001220(1)) ) = a(A049084(A001220(2)) ) = 1.

KEYWORD

nonn,easy

STATUS

approved

editing

#31 by N. J. A. Sloane at Fri Jun 03 10:56:34 EDT 2016

STATUS

editing

approved

#30 by N. J. A. Sloane at Fri Jun 03 10:56:32 EDT 2016

REFERENCES

Waldemar Meissner, Über die Teilbarkeit von 2p-2 durch das Quadrat der Primzahl p=1093, Sitzungsberichte der Koeniglich Preussischen Akademie der Wissenschaften, (1913), S. 663-667

LINKS

W. Meissner, <a href="/A001917/a001917.pdf">Über die Teilbarkeit von 2^p-2 durch das Quadrat der Primzahl p = 1093</a>, Sitzungsberichte Königlich Preussischen Akadamie Wissenschaften Berlin, 35 (1913), 663-667. [Annotated scanned copy]

STATUS

approved

editing

#29 by Alois P. Heinz at Sat Apr 02 19:56:17 EDT 2016

STATUS

editing

approved

#28 by Alois P. Heinz at Sat Apr 02 19:56:09 EDT 2016

NAME

a(n) = 2^(prime(n)-1) mod prime(n)^2.

STATUS

approved

editing