Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with digits
Search options questions only
not deleted
user 5585
3
votes
0
answers
170
views
A recursion for the total number of 1's in binary expansions of the first natural numbers?
Let $$a(n)=a(2^k-n)+k(n-2^{k-1})$$ for $$1 \leqslant {2^{k - 1}} < n \leqslant {2^k}$$
with initial values $a(0)=0, a(1)=0, a(2)=1.$
The first values are $0,0,1,2,4,5,7,9,12,13,15,\dots.$
Compari …
- 5,622