Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135279
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135279 Smallest k such that x^k is (+1 or -1) mod p for all nonzero x relatively prime to p, where p=prime(n)=A000040(n). +0
1
1, 2, 2, 3, 5, 6, 8, 9, 11, 14, 15 (list; graph; listen)
OFFSET

1,2

FORMULA

maybe a(1)=1 a(2)=2, a(n)=f(n-1) where f is A005097.

EXAMPLE

a(6)=6 because X^6 (mod 13) is +-1.

CROSSREFS

Cf. A009057.

Cf. A002322, A005097.

Adjacent sequences: A135276 A135277 A135278 this_sequence A135280 A135281 A135282

Sequence in context: A096981 A035541 A060966 this_sequence A035631 A050046 A052337

KEYWORD

more,nonn

AUTHOR

Masahiko Shin (qqbf2msd(AT)etude.ocn.ne.jp), Dec 02 2007

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 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 October 6 15:49 EDT 2008. Contains 144667 sequences.


AT&T Labs Research