A261442 Number of binary strings of length n+6 such that the smallest number whose binary representation is not visible in the string is 6.

0, 2, 6, 15, 32, 64, 120, 218, 385, 668, 1142, 1933, 3245, 5415, 8992, 14876, 24534, 40362, 66263, 108597, 177714, 290454, 474195, 773433, 1260447, 2052608, 3340437, 5433105, 8832176, 14351131, 23309037, 37844339, 61423189, 99662849, 161665292, 262176955

Offset

0,2

Links

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (4,-4,-2,4,-1,2,-2,-1,1).

Formula

a(n) = A261019(n+6,6).

G.f.: (x^2+2*x-2)*x/((x+1)*(x^2+x-1)*(x^3+x-1)*(x-1)^3). - Alois P. Heinz, Aug 19 2015

Prog

(Haskell)
a261442 n = a261019' (n + 6) 6

Crossrefs

Column k=6 of A261019.

Sequence in context: A290068 A289935 A289969 * A078406 A327598 A258348

Adjacent sequences: A261439 A261440 A261441 * A261443 A261444 A261445

Keyword

nonn,easy

Author

Reinhard Zumkeller, Aug 18 2015

Extensions

More terms from Alois P. Heinz, Aug 19 2015

Status

approved