Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068495
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068495 Composite n such that n reduced mod(phi(n)) = sigma(n) reduced mod(n). +0
1
6, 56, 260, 780, 992, 1976, 2156, 3696, 5520, 13800, 16256, 19872, 22560, 23688, 25232, 41072, 87000, 89964, 133984, 145888, 366720, 785808, 851760, 1100864, 1235052, 1270208, 1439552, 1470720, 2129400, 2237888 (list; graph; listen)
OFFSET

1,1

PROGRAM

(PARI) for(n=3, 500000, if(n%eulerphi(n)==(1-isprime(n))*sigma(n)%n, print1(n, ", ")))

CROSSREFS

Sequence in context: A045526 A137034 A053127 this_sequence A097126 A074019 A074018

Adjacent sequences: A068492 A068493 A068494 this_sequence A068496 A068497 A068498

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 11 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research