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 A064737 #19 Feb 13 2025 12:04:10
%S A064737 0,1,1,2,3,5,8,3,2,6,8,4,3,8,1,10,1,2,4,6,0,7,7,4,2,7,9,6,6,3,10,3,4,
%T A064737 8,2,1,4,5,9,4,4,9,3,3,7,0,8,8,6,5,2,8,0,9,9,8,8,7,6,4,1,6,7,3,1,5,6,
%U A064737 1,8,9,7,7,5,3,9,2,2,5,7,2,10,2,3,6,9,5,5,1,7,8,5,4,10,4,5,10,5,6,2,9,1,1
%N A064737 Fibonacci sequence (A000045) mod 10 with carry.
%C A064737 Observation (from Kaprekar) this sequence can be the reverse of 1/109 (A021113) which is recurring and has a period of 108 digits:
%C A064737 0.[009174311926605504587155963302752293577981651376146788\
%C A064737 990825688073394495412844036697247706422018348623853211]. - _Eric Desbiaux_, Oct 28 2008
%H A064737 Primes.utm.edu, <a href="https://t5k.org/curios/page.php/109.html">Sum of 11^n*10^n</a> [From _Eric Desbiaux_, Oct 28 2008]
%t A064737 f[0] = 0; f[1] = f[2] = 1; f[n_] := f[n] = Block[{k}, If[f[n - 2] + f[n - 3] >= 10, k = 1, k = 0]; Mod[f[n - 1] + f[n - 2], 10] + k]; Table[ f[n], {n, 0, 100} ]
%Y A064737 Cf. A000045.
%K A064737 easy,nonn
%O A064737 0,4
%A A064737 _Robert G. Wilson v_, Oct 17 2001