Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069049
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069049 Numbers n such that 2^n (mod n) = 2^phi(n) (mod phi(n)). +0
1
1, 2, 4, 8, 14, 16, 22, 26, 32, 44, 46, 52, 62, 64, 92, 94, 108, 112, 118, 124, 128, 154, 164, 166, 188, 214, 222, 234, 236, 244, 252, 256, 258, 264, 288, 332, 334, 336, 358, 390, 412, 428, 438, 454, 456, 504, 512, 526, 534, 546, 576, 582, 630, 664, 668, 672 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Adjacent sequences: A069046 A069047 A069048 this_sequence A069050 A069051 A069052

Sequence in context: A086303 A121982 A143423 this_sequence A124853 A084621 A002132

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 03 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 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research