login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066578 a(n) = floor(n/(sum of digits of n)). 3
1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 5, 4, 3, 2, 2, 2, 2, 2, 1, 10, 7, 5, 4, 4, 3, 3, 3, 2, 2, 10, 7, 6, 5, 4, 4, 4, 3, 3, 3, 10, 8, 7, 6, 5, 5, 4, 4, 4, 3, 10, 8, 7, 6, 6, 5, 5, 4, 4, 4, 10, 8, 7, 7, 6, 5, 5, 5, 4, 4, 10, 8, 8, 7, 6, 6, 5, 5, 5, 4, 10, 9, 8, 7, 7, 6, 6, 5, 5, 5, 10, 9, 8, 7, 7, 6, 6, 6, 5, 5, 100 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,10
LINKS
EXAMPLE
a(12) = floor(12/(1+2)) = 4; a(14) = floor(14/(1+4)) = floor(2.8) = 2.
a(24) = floor(24/(2+4)) = 4. a(29) = floor(29/(2+9)) = 2.
PROG
(PARI) SumD(x)=my(s); while (x>9, s+=x%10; x\=10); return(s + x)
for (n=1, 1000, a=floor(n/SumD(n)); write("b066578.txt", n, " ", a)) \\ Harry J. Smith, Mar 07 2010
(PARI) a(n) = n\sumdigits(n); \\ Michel Marcus, Jan 04 2016
CROSSREFS
Sequence in context: A102584 A134167 A080461 * A097327 A226583 A007272
KEYWORD
nonn,base
AUTHOR
Amarnath Murthy, Dec 20 2001
EXTENSIONS
More terms from Reinhard Zumkeller, Feb 26 2003
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)