Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056750
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A056750
%S A056750 1,2,4,7,10,14,28,49,50,70,98,196,209,250,343,350,490,539,668,686,1250,
%T A056750 1309,1372,1519,1750,1919,2401,2450,2690,2849,3430,4450,4802,6250,8750,
%U A056750 9212,9590,9604,9982,10717,12250,15698,16807,17150,18790,24010,31250
%N A056750 Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.
%t A056750 Do[ If[ Mod[ PowerMod[ 7, n, n ] + PowerMod[ 6, n, n ] + PowerMod[ 5, 
               n, n ] + PowerMod[ 4, n, n ] + PowerMod[ 3, n, n ] + PowerMod[ 2, 
               n, n ] + 1, n ] == 0, Print[ n ] ], {n, 1, 10^6} ]
%Y A056750 Cf. A001554.
%Y A056750 Sequence in context: A094281 A076101 A079963 this_sequence A095116 A027384 
               A022939
%Y A056750 Adjacent sequences: A056747 A056748 A056749 this_sequence A056751 A056752 
               A056753
%K A056750 nonn
%O A056750 1,2
%A A056750 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 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research