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 A289749 #45 Jul 15 2023 06:38:53 %S A289749 1,1,2,3,3,5,5,5,8,8,8,5,10,13,12,12,13,10,7,15,18,21,16,20,20,16,21, %T A289749 18,15,7,17,25,27,27,34,29,20,32,32,32,20,29,34,27,27,25,17,9,24,32, %U A289749 40,33,45,45,39,55,50,45,24,40,52,48,48,52,40,24,45,50,55,39,45,45 %N A289749 Number of ways not ending in 011 to write n in base phi. %C A289749 Old name was: Number of ways to write n in base phi. %C A289749 phi = (1+sqrt(5))/2. Base phi is also called golden ratio base or phinary. In base phi, we can replace two consecutive 1's with a one in the column to the left; e.g., "011" = "100". %C A289749 Conjecture: a(A005248(k)) = 2k+1 for k=1,2,...(cf. Theorem 2 in the paper by Carlitz.) - _Michel Dekking_, Nov 14 2021 %C A289749 This conjecture is proved in the paper "Counting base phi representations". - _Michel Dekking_, Jul 15 2023 %H A289749 L. Carlitz, <a href="https://fq.math.ca/Scanned/6-4/carlitz.pdf">Fibonacci Representations</a>, Fibonacci Quarterly, volume 6, number 4, October 1968, pages 193-220. %H A289749 Michel Dekking and Ad van Loon, <a href="https://arxiv.org/abs/2304.11387">Counting base phi representations</a>, arXiv:2304.11387 [math.NT], 2023. %H A289749 Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/phigits.html">Base phi calculator</a>. %e A289749 a(3) = 3, because 3 in base phi = 10.1111 = 11.01 = 100.01. %Y A289749 Cf. A001622, A130600, A130601. %K A289749 nonn,base %O A289749 0,3 %A A289749 Gilian Breysens, Jul 11 2017 %E A289749 Name corrected by _Michel Dekking_, Sep 09 2021