Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073911
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A073911
%S A073911 5,0,135,0,525,0,175,0,495,0,0,0,0,0,3525,0,0,0,0,0,735,0,0,0,55125,0,
%T A073911 3915,0,0,0,0,0,0,0,1575,0,0,0,0,0,0,0,0,0,15975,0,0,0,37975,0,0,0,0,0,
%U A073911 0,0,0,0,0,0,0,0,9765,0,0,0,0,0,0,0,0,0,0,0,155625,0,0,0,0,0,31995,0,0
%N A073911 Smallest number m such that m and the product of digits of m are both 
               divisible by 5n, or 0 if no such number exists.
%C A073911 Here 0 is regarded as not divisible by any number.
%C A073911 a[n]=0 if n is divisible by 2 or contains a prime divisor >9. - Sascha 
               Kurz (sascha.kurz(AT)uni-bayreuth.de), Aug 23 2002
%p A073911 f := 5:for i from 1 to 400 do b := ifactors(f*i)[2]: if b[nops(b)][1]>
               9 or (f*i mod 10) =0 then a[i] := 0:else j := 0:while true do j := 
               j+f*i:c := convert(j,base,10): d := product(c[k],k=1..nops(c)): if 
               (d mod f*i)=0 and d>0 then a[i] := j:break:fi: od:fi:od:seq(a[k],
               k=1..400);
%Y A073911 Cf. A073906, A073907, A073908, A073909, A073910, A073912.
%Y A073911 Sequence in context: A047769 A103709 A122045 this_sequence A157302 A036946 
               A164940
%Y A073911 Adjacent sequences: A073908 A073909 A073910 this_sequence A073912 A073913 
               A073914
%K A073911 nonn,base
%O A073911 1,1
%A A073911 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 18 2002
%E A073911 More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Aug 23 
               2002

    
page 1

Search completed in 0.001 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research