A269502 - OEIS

A269502

Number of contiguous substrings of the binary representation of n that are equal to some a(m) where 1 <= m < n and where a(1)=1.

1, 1, 2, 2, 4, 3, 5, 3, 6, 7, 8, 6, 8, 8, 9, 4, 8, 10, 11, 10, 12, 12, 13, 8, 11, 12, 13, 10, 12, 11, 12, 4, 9, 12, 13, 13, 15, 15, 16, 12, 15, 16, 17, 15, 17, 15, 18, 9, 13, 15, 15, 14, 16, 16, 17, 12, 15, 16, 17, 15

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

Table of n, a(n) for n=1..60.

Marko Riedel, Maple program for A269502 and A272976.

EXAMPLE

a(7) = 5 because 7 = (111)_2 and (1)_2 occurs three times and (11)_2 two times; (111)_2 does not occur among a(1) ... a(6).

CROSSREFS

Cf. A272886, A272851, A272976.

Sequence in context: A173387 A133438 A086671 * A054346 A145393 A215675

Adjacent sequences: A269499 A269500 A269501 * A269503 A269504 A269505

KEYWORD

base,nonn

AUTHOR

Marko Riedel, May 11 2016

STATUS

approved