Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087428
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087428 a(n) = [(p-1)/2 * (q-1)/2] mod p where p = (n+1)th odd prime, q = n-th odd prime. +0
2
2, 6, 4, 4, 14, 15, 7, 9, 24, 11, 32, 33, 13, 15, 46, 16, 52, 19, 19, 61, 22, 24, 75, 77, 78, 28, 28, 86, 99, 34, 36, 105, 40, 114, 41, 124, 43, 45, 136, 46, 146, 49, 149, 150, 56, 59, 58, 58, 176, 181, 61, 191, 66, 199, 69, 204, 71, 212, 213, 76, 234, 79, 79, 239, 252, 86 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = A087427(n+2) mod p.

EXAMPLE

a(3) = 4 = (5)(3) mod 11; p = 7, q = 5; (p-1)/2 = 5, (q-1)/2 = 3.

A087427(5) = 15, A087428(3) = 15 mod 11 = 4.

CROSSREFS

Sequence in context: A053794 A003077 A057143 this_sequence A115508 A021382 A010465

Adjacent sequences: A087425 A087426 A087427 this_sequence A087429 A087430 A087431

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 01 2003

EXTENSIONS

Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 16 2003

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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research