Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119388
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119388 Numbers n such that n == -1 (mod phi(n-1)). +0
1
2, 3, 5, 7, 11, 31, 71, 511, 2591, 131071, 3359231, 167247871 (list; graph; listen)
OFFSET

1,1

COMMENT

This sequence has the terms from A067933 (all primes), plus 511 and 3359231 that are not primes.

Checked up to x<70000000

PROGRAM

(PARI) for(x=1, 70000000, if(((x)+1)%eulerphi((x)-1)==0, print((x))))

CROSSREFS

Cf. A067933.

Sequence in context: A028906 A118496 A085300 this_sequence A093487 A067933 A005234

Adjacent sequences: A119385 A119386 A119387 this_sequence A119389 A119390 A119391

KEYWORD

nonn

AUTHOR

Jorge Coveiro (jorgecoveiro(AT)yahoo.com), Jul 25 2006

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 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research