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 A048297 #12 Apr 17 2022 23:10:37 %S A048297 1,4,7,13,16,25,28,31,49,52,55,61,64,97,100,103,109,112,121,124,127, %T A048297 193,196,199,205,208,217,220,223,241,244,247,253,256,385,388,391,397, %U A048297 400,409,412,415,433,436,439,445,448,481,484,487,493,496,505 %N A048297 Coefficients in power series expansion over GF(2)[ X^(-1) ] of continued fraction [ 0, X, X^2, X^4, X^8, X^16, ... ]. %D A048297 M. Morii and M. Kasahara, Perfect staircase profile of linear complexity for finite sequences, Info. Proc. Letters 44 (1992), 85-89, esp. p. 88. %F A048297 n is in the sequence iff 2n-1 is in iff 4n is in [and a(0)=1]. So a(Fib(n)) = 2^n if n is even and a(Fib(n)) = 2^n-1 if n is odd. - _Henry Bottomley_, Sep 25 2000 %F A048297 a(n) = 3*A003714(n)+1. - _T. D. Noe_, Dec 20 2006 %Y A048297 Cf. A003714 (Fibbinary numbers). %K A048297 nonn %O A048297 0,2 %A A048297 _Jeffrey Shallit_