|
Search: id:A094798
|
|
|
| A094798 |
|
Number of times 1 is used in writing out all the numbers 1 through n. |
|
+0
6
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18
(list; graph; listen)
|
|
|
OFFSET
|
1,10
|
|
|
COMMENT
|
The number of 1's required to write all integers of n or fewer digits (i.e. the sequence a(9), a(99), a(999), ...) is 1, 20, 300, 4000, ..., which is A053541. - Jason D. W. Taff (jtaff(AT)jburroughs.org), Dec 05 2004
A014778 gives the fixed points. - David Wasserman (wasserma(AT)spawar.navy.mil), Feb 22 2005
|
|
MAPLE
|
nones:=proc(n) local nn, c, j: nn:=convert(n, base, 10): c:=0: for j to nops(nn) do if nn[j]=1 then c:=c+1 else end if end do: c end proc: a:=proc(n) options operator, arrow: add(nones(k), k=1..n) end proc: seq(a(n), n=1..75); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 01 2008
|
|
CROSSREFS
|
Cf. A014778, A053541.
Sequence in context: A058317 A100006 A004722 this_sequence A162880 A083792 A083794
Adjacent sequences: A094795 A094796 A094797 this_sequence A094799 A094800 A094801
|
|
KEYWORD
|
easy,base,nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 11 2004
|
|
|
Search completed in 0.002 seconds
|
