Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109660
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A109660
%S A109660 1,2,3,7,9,15,18,27,52,72,261,360,400,3932,4418,7046,7938,8888,9162,
%T A109660 9363,9606,9738,10083,10809,11970,13958,23571,28384,42159,51515
%N A109660 Numbers n such that the sum of the digits of n^phi(n) is divisible by 
               n.
%e A109660 The digits of 8888^phi(8888) sum to 71104 and 71104 is divisible by 8888, 
               so 8888 is in the sequence.
%t A109660 Do[s = n^EulerPhi[n]; k = Plus @@ IntegerDigits[s]; If[Mod[k, n] == 0, 
               Print[n]], {n, 1, 10000}]
%Y A109660 Sequence in context: A014837 A019312 A135369 this_sequence A075855 A140189 
               A165803
%Y A109660 Adjacent sequences: A109657 A109658 A109659 this_sequence A109661 A109662 
               A109663
%K A109660 base,nonn
%O A109660 1,2
%A A109660 Ryan Propper (rpropper(AT)stanford.edu), Aug 06 2005
%E A109660 More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 05 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research