Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005349
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005349 Niven (or Harshad) numbers: numbers that are divisible by the sum of their digits.
(Formerly M0481)
+0
94
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42, 45, 48, 50, 54, 60, 63, 70, 72, 80, 81, 84, 90, 100, 102, 108, 110, 111, 112, 114, 117, 120, 126, 132, 133, 135, 140, 144, 150, 152, 153, 156, 162, 171, 180, 190, 192, 195, 198, 200, 201, 204 (list; graph; listen)
OFFSET

1,2

COMMENT

z-Niven numbers are numbers n which are divisible by (A*s(n)+ B) where A,B are integers and s(n) is sum of digits of n. Niven numbers have A=1, B=0. - Ctibor O. ZIZKA (ctibor.zizka(AT)seznam.cz), Feb 23 2008

A070635(a(n)) = 0; apart from initial term A008591 is a subsequence. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 10 2008

REFERENCES

R. K. Guy, The second strong law of small numbers. Math. Mag. 63 (1990), no. 1, 3-20.

R. E. Kennedy and C. N. Cooper, On the natural density of the Niven numbers, Abstract 816-11-219, Abstracts Amer. Math. Soc., 6 (1985), 17.

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

D. Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, 171.

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 1..11872 (all a(n) <= 100000)

Jean-Marie De Koninck and Nicolas Doyon, Large and Small Gaps Between Consecutive Niven Numbers, J. Integer Seqs., Vol. 6, 2003.

R. E. Kennedy, Niven Numbers for Fun and Profit

G. Villemin's Almanac of Numbers, Harshad Numbers

G. Villemin's Almanac Of Numbers, Harshad Numbers

Eric Weisstein's World of Mathematics, Harshad Numbers

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Wikipedia, Harshad number

EXAMPLE

195 is a term of the sequence because it is divisible by 15 (=1+9+5).

MAPLE

s:=proc(n) local N:N:=convert(n, base, 10):sum(N[j], j=1..nops(N)) end:p:=proc(n) if floor(n/s(n))=n/s(n) then n else fi end: seq(p(n), n=1..210); (Deutsch)

MATHEMATICA

Select[Range[1000], IntegerQ[ #/(Plus @@ IntegerDigits[ # ])] &] (from Alonso Delarte (alonso.delarte(AT)gmail.com), Aug 04 2004)

CROSSREFS

Cf. A007953, A052018, A052019, A052020, A052021, A052022, A028834.

Sequence in context: A143289 A064807 A007603 this_sequence A085135 A085133 A110806

Adjacent sequences: A005346 A005347 A005348 this_sequence A005350 A005351 A005352

KEYWORD

nonn,base,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research