Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067930
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067930 composite solutions to n==-1 (mod phi(n+1)). +0
1
1, 15, 35, 63, 95, 143, 161, 215, 255, 287, 323, 485, 511, 575, 767, 1023, 1295, 1457, 1535, 1727, 1943, 2047, 2303, 2915, 3071, 3455, 3887, 4095, 4607, 5183, 5831, 7775, 9215, 10367, 11663, 12287, 13823, 16383, 17495, 18431, 20735, 24575, 26243 (list; graph; listen)
OFFSET

1,2

COMMENT

odd terms in A005105(n) are primes solutions to p==-1 (mod phi(p+1))

CROSSREFS

Cf. A005105.

Adjacent sequences: A067927 A067928 A067929 this_sequence A067931 A067932 A067933

Sequence in context: A108668 A063532 A090196 this_sequence A098271 A082663 A109068

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 22 2002

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 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research