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 A382130 #28 Mar 22 2025 22:51:21 %S A382130 1,1,6,1,1,6,8,1,0,1,3,6,3,8,9,1,8,0,8,1,7,3,4,6,9,3,8,8,9,9,4,1,8,8, %T A382130 4,0,8,8,2,1,0,7,4,3,5,4,8,6,6,9,8,3,3,8,4,8,3,9,6,9,5,4,6,1,3,8,8,8, %U A382130 1,4,1,0,7,8,7,8,2,2,0,1,3,0,0,7,9,4,1,3,7,5,9,4,8,8,0 %N A382130 Fractalization of the golden ratio. %C A382130 Self-descriptive sequence: even indexed terms are the sequence itself, odd indexed terms are the decimal digits of the golden ratio. %C A382130 This is an r1k1 fractal sequence, where r1k1 means: remove 1 term, keep 1 term, repeat. The Removed terms are the sequence that has been fractalized, and the Kept terms are the original fractal sequence. %C A382130 This fractal sequence is not a Kimberling fractal sequence because if you delete the first occurrence of each term, the remaining sequence is not the same as the original. %H A382130 David Cleaver, <a href="/A382130/b382130.txt">Table of n, a(n) for n = 1..10000</a> %H A382130 Clark Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/fractals.html">Fractal sequences</a>. %F A382130 a(2n) = a(n); a(2n-1) = A001622(n), n >= 1. %F A382130 a(n) = A001622(A003602(n)). %Y A382130 Bisection gives A001622 (odd part). %Y A382130 Cf. A003602, A110766, A110779, A110812, A382128, A382129. %K A382130 nonn,easy,base %O A382130 1,3 %A A382130 _David Cleaver_, Mar 16 2025