1,2

Proposed name: N-fusc.

Each number n>0 appears in this sequence exactly n times.

I. V. Serov, Table of n, a(n) for n = 1..8192

a(1) = 1; for n>1: a(n) = (A002487(n-1) + A002487(n) + A002487(n+1))/2.

a(n) = A007306(n) - A288002(n).

Table[Block[{a = 1, b = 0, m = n}, While[m > 0, If[OddQ@ m, b = a + b, a = a + b]; m = Floor[m/2]]; b] IntegerExponent[2 n, 2], {n, 89}] (* Michael De Vlieger, Jun 14 2017, after Jean-François Alcover at A002487 *)

Cf. A001511, A002487, A007306, A288002.

Sequence in context: A161511 A100197 A057022 * A087504 A067539 A166312

Adjacent sequences: A287893 A287894 A287895 * A287897 A287898 A287899

nonn

I. V. Serov, Jun 02 2017

approved