|
| |
|
|
A014082
|
|
Occurrences of '111' in binary expansion of n.
|
|
10
| |
|
|
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 2, 3, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 3, 4, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 2, 3, 0, 0, 0, 0, 0, 0, 0, 1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,16
|
|
|
LINKS
| R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences related to binary expansion of n
|
|
|
FORMULA
| a(2n) = a(n), a(2n+1) = a(n) + [n congruent to 3 mod 4]. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Aug 21 2003
G.f.: 1/(1-x) * sum(k>=0, t^7(1-t)/(1-t^8), t=x^2^k). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 08 2003
|
|
|
MAPLE
| See A014081.
|
|
|
MATHEMATICA
| f[n_] := Count[ Partition[ IntegerDigits[n, 2], 3, 1], {1, 1, 1}]; Table[f@n, {n, 0, 104}] [From Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 02 2009]
|
|
|
CROSSREFS
| Cf. A014081, A033264, A056974, A056975, A056976, A056977, A056978, A056979, A056980.
Sequence in context: A104488 A010103 A086078 * A102354 A193138 A162641
Adjacent sequences: A014079 A014080 A014081 * A014083 A014084 A014085
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Simon Plouffe (simon.plouffe(AT)gmail.com)
|
| |
|
|
