Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143663
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143663 a(n) is the least prime such that the multiplicative order of 3 mod a(n) equals n, or a(n)=1 if such prime does not exist. +0
3
2, 1, 13, 5, 11, 7, 1093, 41, 757, 61, 23, 73, 797161, 547, 4561, 17, 1871, 19, 1597, 1181, 368089, 67, 47, 6481, 8951, 398581, 109, 29, 59, 31, 683, 21523361 (list; graph; listen)
OFFSET

1,1

COMMENT

If a(n) differs from 1, then a(n) is the minimal prime divisor of A064079(n).

CROSSREFS

Cf. A002326 A064079.

Sequence in context: A007418 A037271 A074955 this_sequence A064079 A167584 A112226

Adjacent sequences: A143660 A143661 A143662 this_sequence A143664 A143665 A143666

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Aug 28 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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research