|
| |
|
|
A014083
|
|
Occurrences of '1111' in binary expansion of n.
|
|
0
| |
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,31
|
|
|
LINKS
| R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
|
FORMULA
| a(2n) = a(n), a(2n+1) = a(n) + [n congruent to 7 mod 8]. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Aug 21 2003
G.f.: 1/(1-x) * sum(k>=0, t^15(1-t)/(1-t^16), t=x^2^k). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 08 2003
|
|
|
MAPLE
| See A014081.
|
|
|
PROG
| (PARI) u1111(n)=local(v):v=binary(n):sum(k=1, length(v)-3, v[k]&&v[k+1]&&v[k+2]&&v[k+3])
|
|
|
CROSSREFS
| Sequence in context: A130706 A000038 A063667 * A112315 A005926 A089803
Adjacent sequences: A014080 A014081 A014082 * A014084 A014085 A014086
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Simon Plouffe (simon.plouffe(AT)gmail.com)
|
| |
|
|
