This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277831 Number of digits '1' in the set of all numbers from 0 to A014824(n) = sum_{i=1..n} i*10^(n-i) = (0, 1, 12, 123, 1234, 12345, ...). 3
 0, 1, 5, 57, 689, 8121, 93553, 1058985, 11824417, 130589849, 1429355281, 15528120716, 167626886179, 1799725651922, 19231824420465, 204663923217008, 2170096022293551, 22935528124170094, 241700960254046637, 2540466392663923180, 26639231827873799724 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Lars Blomberg, Table of n, a(n) for n = 0..998 M. F. Hasler, "Digits d in 0 through 123...n", OEIS Wiki, Nov. 2016. FORMULA a(n) = A277832(n) + 3*10^(n-2), for n >= 2. More generally, for m = 0, ..., 9, let a[m] denote A277830, ..., A277838 and A277849, respectively. Then a[0](n) = a[n](n) = a[m](n) + 1 for all m > n >= 0, and a[m-1](n) = a[m](n) + (m+1)*10^(n-m) for all n >= m > 1. EXAMPLE For n=2 are counted the same '1' as for n=1, plus the 4 additional digits '1' in 10, 11 and 12. PROG (PARI) print1(c=N=0); for(n=1, 8, print1(", "c+=sum(k=N+1, N=N*10+n, #select(d->d==1, digits(k))))) (PARI) A277831(n)=if(n<2, n, A277832(n)+3*10^(n-2)) \\ M. F. Hasler, Nov 02 2016 CROSSREFS Cf. A277830 - A277838, A277849, A277635, A272525, A083449, A014824. Sequence in context: A114466 A155642 A322248 * A223382 A155539 A285067 Adjacent sequences:  A277828 A277829 A277830 * A277832 A277833 A277834 KEYWORD nonn,base AUTHOR M. F. Hasler, Nov 01 2016 EXTENSIONS More terms from Lars Blomberg, Nov 05 2016 STATUS approved

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 September 20 02:20 EDT 2019. Contains 327207 sequences. (Running on oeis4.)