This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A275992 #8 Sep 17 2016 12:17:12 %S A275992 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, %T A275992 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, %U A275992 5,2,4,4,4,4,2,5,5,3,3,4,5,3,3,4,4,1,4 %N A275992 Number of times n occurs in A022290. %C A275992 A000119 counts the ways n can be represented as a sum of distinct Fibonacci numbers. A022290 maps binary ordering onto these Fibonacci representations. %C A275992 A274515 is an analogous sequence applied to A002487. %H A275992 Max Barrentine, <a href="/A275992/b275992.txt">Table of n, a(n) for n = 0..10922</a> %F A275992 a(n) = A000119(A022290(n)). %Y A275992 Cf. A000119, A022290, A274515, A002487. %K A275992 nonn %O A275992 0,4 %A A275992 _Max Barrentine_, Aug 15 2016