This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275624 a(n) = minimal m such that Sum_{k=1..m} 0.k >= n. 4
 4, 6, 8, 9, 14, 20, 24, 28, 31, 34, 37, 40, 42, 45, 47, 49, 51, 53, 55, 56, 58, 60, 62, 63, 65, 66, 68, 69, 71, 72, 73, 75, 76, 77, 79, 80, 81, 82, 84, 85, 86, 87, 88, 89, 90, 92, 93, 94, 95, 96, 97, 98, 99, 104, 113, 122, 130, 137, 144, 151, 157, 164, 170 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Here 0.k means the decimal fraction obtained by writing k after the decimal point, e.g. 0.12 = 12/100 = 3/25. LINKS Alois P. Heinz, Table of n, a(n) for n = 1..20000 EXAMPLE a(7) = 20 because .1 + .2 + ... + .9 + .10 + .11 + ... + .20 = 141/20 = 7.05 is the first time the sum reaches 7. MAPLE b:= proc(n) option remember;        n/10^length(n)+`if`(n<2, 0, b(n-1))     end: a:= proc(n) option remember; local k; for k from       `if`(n=1, 1, a(n-1)) while b(k)

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 January 18 23:05 EST 2019. Contains 319282 sequences. (Running on oeis4.)