Search: id:A058906
Results 1-1 of 1 results found.

%I A058906
%S A058906 68,70,79,80,82,92,104,200,202,212,214,224,225,248,260,314,320,332,
%T A058906 380,392,452,458,464,490,502,508,512,513,514,518,520,524,530,562,
%U A058906 568,574,578,579,580,584,585,590,592,595,598,599,622,628,634,635
%N A058906 Inconsummate numbers in base 11: no number is this multiple of the sum 
               of its digits (in base 11).
%H A058906 David Radcliffe, <a href="http://gotmath.com/inconsummate">Inconsummate 
               Numbers</a>
%p A058906 digitsum := proc (n,b) local i; add(i,i=convert(n,base,b)) end; b := 
               11:N := 43922; L := []: for n from 1 to N do k := digitsum(n,b): 
               if (n mod k)=0 then L := [op(L), n/k] fi: od: M := []: for i from 
               1 to 1000 do if not(member(i,L)) then M := [op(M),i] fi od: lprint(M);
%t A058906 base = 11; Do[k = n; While[ Apply[ Plus, IntegerDigits[k, base] ]*n != 
               k && k < 250n, k += n]; If[k == 250n, Print[n] ], {n, 1, 10^3} ]
%Y A058906 Cf. A003635, A052491, A058898-A058907.
%Y A058906 Sequence in context: A043854 A043862 A043871 this_sequence A130694 A153831 
               A058980
%Y A058906 Adjacent sequences: A058903 A058904 A058905 this_sequence A058907 A058908 
               A058909
%K A058906 nonn,base
%O A058906 1,1
%A A058906 N. J. A. Sloane (njas(AT)research.att.com), Jan 09 2001

Search completed in 0.001 seconds