The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A003635 Inconsummate numbers in base 10: no number is this multiple of the sum of its digits (in base 10). (Formerly M5325) 20

%I M5325

%S 62,63,65,75,84,95,161,173,195,216,261,266,272,276,326,371,372,377,

%T 381,383,386,387,395,411,416,422,426,431,432,438,441,443,461,466,471,

%U 476,482,483,486,488,491,492,493,494,497,498,516,521,522,527,531,533,536

%N Inconsummate numbers in base 10: no number is this multiple of the sum of its digits (in base 10).

%D J. H. Conway, personal communication.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Daniel Mondot, <a href="/A003635/b003635.txt">Table of n, a(n) for n = 1..10867</a>

%H David Radcliffe, <a href="http://gotmath.com/inconsummate.html">Inconsummate Numbers</a>

%p For Maple code see A058906.

%t nmax = 1000; Reap[ Do[k = n; kmax = 100*n; While[ Tr[ IntegerDigits[k]]*n != k && k < kmax, k = k + n]; If[k == kmax, Sow[n]], {n, 1, nmax}]][[2, 1]] (* _Jean-François Alcover_, Jul 12 2012 *)

%Y Cf. A003634, A052489, A052490, A052491, A058898-A058917.

%K nonn,easy,nice,base

%O 1,1

%A _N. J. A. Sloane_ and _Mira Bernstein_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 4 09:03 EDT 2020. Contains 336201 sequences. (Running on oeis4.)