Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156753
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A156753
%S A156753 11,101,167,211,257,347,431,523,541,617,743,761,853,1021,1087,1153,1201,
%T A156753 1373,1427,1483,1531,1571,1607,1733,1861,2011,2053,2141,2237,2251,2273,
%U A156753 2383,2411,2417,2503,2521,2741,2833,2851,3041,3137,3371,3407,3511,3823
%N A156753 Primes where the largest digit is equal to the sum of all the other digits.
%H A156753 Chris Caldwell, <a href="http://primes.utm.edu/lists/small/1000.txt">
               The First 1,000 Primes</a>
%e A156753 1571 is a prime in which the largest digit is equal to the sum of all 
               the other digits.
%p A156753 A054055 := proc(n) max(op(convert(n,base,10))) ; end: A007953 := proc(n) 
               add(d,d=convert(n,base,10)) ; end: for n from 1 to 800 do p := ithprime(n) 
               ; if 2*A054055(p) = A007953(p) then printf("%d,",p) ; fi; od: [From 
               R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 20 2009]
%Y A156753 A000040
%Y A156753 Sequence in context: A083144 A058411 A134462 this_sequence A118592 A156617 
               A089716
%Y A156753 Adjacent sequences: A156750 A156751 A156752 this_sequence A156754 A156755 
               A156756
%K A156753 nonn,base
%O A156753 1,1
%A A156753 Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Feb 14 2009
%E A156753 11 added in front and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Feb 20 2009

    
page 1

Search completed in 0.003 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 4 12:48 EST 2009. Contains 170310 sequences.


AT&T Labs Research