Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038702
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038702 prime(n)^2 mod prime(n-1). +0
12
1, 1, 4, 2, 4, 3, 4, 16, 13, 4, 5, 16, 4, 16, 36, 36, 4, 36, 16, 4, 36, 16, 36, 64, 16, 4, 16, 4, 16, 83, 16, 36, 4, 100, 4, 36, 36, 16, 36, 36, 4, 100, 4, 16, 4, 144, 144, 16, 4, 16, 36, 4, 100, 36, 36, 36, 4, 36, 16, 4, 100, 196, 16, 4 (list; graph; listen)
OFFSET

2,3

EXAMPLE

To get the a(4): square the fourth prime to get 7^2 = 49. The remainder when this is divided by the third prime, 5, is 4. So a(3) = 4.

CROSSREFS

Cf. A038703.

Sequence in context: A056158 A010316 A083954 this_sequence A085062 A053051 A075234

Adjacent sequences: A038699 A038700 A038701 this_sequence A038703 A038704 A038705

KEYWORD

nonn

AUTHOR

N. Fernandez (primeness(AT)borve.org), May 01 2000

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research