A275992 - OEIS

A275992

Number of times n occurs in A022290.

1, 1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 3, 3, 2, 2, 3, 3, 2, 2, 3, 3, 1, 3, 3, 3, 3, 2, 4, 4, 2, 3, 3, 3, 3, 2, 4, 4, 2, 3, 3, 3, 3, 1, 4, 4, 3, 3, 5, 4, 3, 3, 5, 5, 2, 4, 4, 4, 4, 2, 5, 5, 3, 3, 4, 4, 3, 3, 5, 5, 2, 4, 4, 4, 4, 2, 5, 5, 3, 3, 4, 5, 3, 3, 4, 4, 1, 4

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

OFFSET

0,4

COMMENTS

A000119 counts the ways n can be represented as a sum of distinct Fibonacci numbers. A022290 maps binary ordering onto these Fibonacci representations.

A274515 is an analogous sequence applied to A002487.

LINKS

Max Barrentine, Table of n, a(n) for n = 0..10922

FORMULA

a(n) = A000119(A022290(n)).

CROSSREFS

Cf. A000119, A022290, A274515, A002487.

Sequence in context: A339701 A304094 A259527 * A271824 A253589 A332992

Adjacent sequences: A275989 A275990 A275991 * A275993 A275994 A275995

KEYWORD

nonn

AUTHOR

Max Barrentine, Aug 15 2016

STATUS

approved