This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
f[n_] := n - Count[IntegerDigits[n, 2], 0]; Array[f, 73]
Table[n-DigitCount[n,2,0],{n,80}] (* Harvey P. Dale, Dec 24 2015 *)
+---+------+---+---+---------+ | n | bin. |1's|0's| a(n) | +---+------+---+---+---------+ | 0 | 0 | 0 | 1 | 0^1 = 0 | | 1 | 1 | 1 | 0 | 1^0 = 1 | | 2 | 10 | 1 | 1 | 1^1 = 1 | | 3 | 11 | 2 | 0 | 2^0 = 1 | | 4 | 100 | 1 | 2 | 1^2 = 1 | | 5 | 101 | 2 | 1 | 2^1 = 2 | | 6 | 110 | 2 | 1 | 2^1 = 2 | | 7 | 111 | 3 | 0 | 3^0 = 1 | | 8 | 1000 | 1 | 3 | 1^3 = 1 | | 9 | 1001 | 2 | 2 | 2^2 = 4 | +---+------+---+---+---------+ bin. - n written in base 2; 1's - number of 1's in binary expansion of n; 0's - number of 0's in binary expansion of n.
DigitCount[Range[0, 80], 2, 1]^DigitCount[Range[0, 80], 2, 0]
Comments