Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077815
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077815 2^phi(n) mod n^2, where phi=A000010 (Euler's totient). +0
3
0, 2, 4, 4, 16, 4, 15, 16, 64, 16, 56, 16, 40, 64, 31, 0, 222, 64, 58, 256, 127, 56, 392, 256, 451, 40, 433, 176, 30, 256, 187, 0, 958, 800, 841, 208, 38, 780, 586, 1536, 944, 568, 1076, 1200, 91, 392, 2069, 1024, 2157, 1076, 1021, 1600, 1909, 2620, 826, 2752 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(42) = 2^phi(42) mod 42*42 = 2^phi(2*3*7) mod 1764 = 2^(42*(1-1/2)*(1-1/3)*(1-1/7)) mod 1764 = 2^12 mod 1764 = 4096 mod 1764 = 568.

CROSSREFS

Cf. A077816, A000010, A000290.

Sequence in context: A154987 A089419 A145891 this_sequence A064449 A117291 A079102

Adjacent sequences: A077812 A077813 A077814 this_sequence A077816 A077817 A077818

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 17 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 9 00:15 EST 2010. Contains 173097 sequences.


AT&T Labs Research