Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084538
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084538 Least primitive root mod 2*prime(n)^2. +0
1
5, 3, 3, 7, 7, 3, 3, 5, 3, 3, 5, 7, 3, 5, 3, 11, 7, 7, 7, 5, 3, 5, 3, 5, 3, 5, 5, 11, 3, 3, 17, 3, 3, 3, 7, 5, 3, 5, 3, 7, 21, 19, 5, 3, 3, 3, 3, 5, 7, 3, 7, 7, 11, 3, 5, 3, 15, 5, 3, 3, 3, 5, 17, 15, 3, 3, 15, 5, 7, 3, 7, 11, 5, 3, 5, 3, 5, 3, 21, 11, 23, 7, 5, 15, 5, 3, 13, 3, 3, 5, 13, 3, 7, 7, 5, 3, 3 (list; graph; listen)
OFFSET

2,1

REFERENCES

P. D. T. A. Elliott and L. Murata, The least primitive root mod 2*p^2, Mathematika, 45 (1998), 371-379.

MAPLE

with(numtheory): A084538 := n-> primroot(2*ithprime(n)^2);

CROSSREFS

Sequence in context: A019624 A120275 A021656 this_sequence A079799 A021871 A004486

Adjacent sequences: A084535 A084536 A084537 this_sequence A084539 A084540 A084541

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 30 2003

page 1

Search completed in 0.010 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research