A061986 - OEIS

A061986

Number of times n appears in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984.

1, 1, 1, 1, 2, 0, 2, 1, 3, 0, 0, 4, 2, 0, 0, 6, 0, 0, 0, 3, 5, 4, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 6, 0, 0, 0, 10, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 15, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 30, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0

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

OFFSET

0,5

LINKS

Table of n, a(n) for n=0..98.

FORMULA

If n is not in A061985 then a(n)=0, otherwise if n=A061985(m) then a(n) = A061987(m).

CROSSREFS

Sequence in context: A125939 A125942 A291440 * A127185 A159780 A355739

Adjacent sequences: A061983 A061984 A061985 * A061987 A061988 A061989

KEYWORD

nonn

AUTHOR

Henry Bottomley, May 24 2001

STATUS

approved