Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056645
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A056645
%S A056645 1,2,3,9,14,27,81,98,99,153,243,621,686,729,1199,2187,4018,4802,5049,
%T A056645 6561,8019,12393,19683,20541,31509,33614,59049,70389,82377,113974,
%U A056645 150903,177147,226557,235298,299619,308014,340443,408969,423929,531441
%N A056645 Numbers n such that n | 3^n + 2^n + 1^n.
%t A056645 Do[ If[ Mod[ PowerMod[ 3, n, n ] + PowerMod[ 2, n, n ] + 1, n ] == 0, 
               Print[ n ] ], {n, 1, 10^6} ]
%Y A056645 Cf. A001550.
%Y A056645 Sequence in context: A048038 A113501 A101067 this_sequence A047171 A094557 
               A026307
%Y A056645 Adjacent sequences: A056642 A056643 A056644 this_sequence A056646 A056647 
               A056648
%K A056645 nonn
%O A056645 1,2
%A A056645 Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 25 2000

    
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 December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research