Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066008
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066008 Number of n-digit positive integers m for which m/(sum of digits of m) is an integer. +0
3
9, 23, 180, 1325, 10334, 83556, 710667, 6148698 (list; graph; listen)
OFFSET

1,1

LINKS

S. W. Golomb, Sums and products of digits, IEEE Information Theory Society Newsletter, 51 (No. 3, Sept. 2001), p. 15.

PROGRAM

(ARIBAS): function a066008(a, b: integer); var n, c, m, j, k: integer; s: string; begin for n := a to b do c := 0; for m := 10^n to 10^(n+1) - 1 do s := itoa(m); k := 0; for j := 0 to length(s) - 1 do k := k + atoi(s[j..j]); end; if m mod k = 0 then inc(c); end; end; write(c, ", "); end; return; end; a066008(0, 7).

CROSSREFS

Cf. A007953, A034726, A034727.

Adjacent sequences: A066005 A066006 A066007 this_sequence A066009 A066010 A066011

Sequence in context: A024843 A079040 A057453 this_sequence A101058 A102217 A124065

KEYWORD

nonn,base

AUTHOR

njas, Dec 11 2001

EXTENSIONS

One more term from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 12 2001

page 1

Search completed in 0.002 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 October 6 12:54 EDT 2008. Contains 144667 sequences.


AT&T Labs Research