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 A224762 #53 Feb 27 2018 03:33:20 %S A224762 1,1,2,1,3,1,3,2,6,1,5,1,3,4,1,4,3,5,8,1,6,13,1,4,5,8,9,1,6,5,6,3,16, %T A224762 1,7,1,3,6,8,14,1,6,5,16,1,5,4,24,1,5,3,15,1,5,3,7,1,5,3,7,2,54,1,7, %U A224762 31,1,4,21,1,4,5,1,4,5,2,15,25,1,7,17,1,4,11,1,4,5,5,30,1,6,25,15,17,1,6,7,1,4,15,1,4,5,19 %N A224762 Define a sequence of rationals by S(1)=1; for n>=1, write S(1),...,S(n) as XY^k, Y nonempty, where the fractional exponent k is maximized, and set S(n+1)=k; sequence gives numerators of S(1), S(2), ... %C A224762 k is the "fractional curling number" of S(1),...,S(n). The infinite sequence S(1), S(2), ... is a fractional analog of Gijswijt's sequence A090822. %C A224762 For the first 1000 terms, 1 <= S(n) <= 2. Is this always true? %C A224762 The fractional curling number k of S = (S(1), S(2), ..., S(n)) is defined as follows. Write S = X Y Y ... Y Y' where X may be empty, Y is nonempty, there are say i copies of Y, and Y' is a prefix of Y. There may be many ways to do this. Choose the version in which the ratio k = (i|Y|+|Y'|)/|Y| is maximized; this k is the fractional curling number of S. %C A224762 For example, if S = (S(1), ..., S(6)) = (1, 1, 2, 1, 3/2, 1), the best choice is to take X = 1,1,2, Y = 1,3/2, Y' = 1, giving k = (2+1)/2 = 3/2 = S(7). %H A224762 Allan Wilks, <a href="/A224762/b224762.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from N. J. A. Sloane) %H A224762 N. J. A. Sloane, <a href="/A224762/a224762_1.txt">Maple program for fractional curling number and S(1),S(2),...</a> %H A224762 Allan Wilks, <a href="/A224762/a224762.txt">Table of n, S(n) for n = 1..10000</a> [The first 1000 terms were computed by _N. J. A. Sloane_] %e A224762 The sequence S(1), S(2), ... begins 1, 1, 2, 1, 3/2, 1, 3/2, 2, 6/5, 1, 5/4, 1, 3/2, 4/3, 1, 4/3, 3/2, 5/4, 8/7, 1, 6/5, 13/12, 1, 4/3, 5/4, 8/7, 9/7, 1, 6/5, 5/4, 6/5, 3/2, 16/15, 1, 7/6, 1, 3/2, 6/5, 8/7, 14/13, 1, 6/5, 5/4, 16/13, 1, 5/4, 4/3, 24/23, 1, 5/4, 3/2, 15/14, 1, 5/4, 3/2, 7/4, ... %p A224762 See link. %Y A224762 Cf. A224763 (denominators), A090822, A224765. %K A224762 nonn,frac %O A224762 1,3 %A A224762 Conference dinner party, Workshop on Challenges in Combinatorics on Words, Fields Institute, Toronto, Apr 22 2013, entered by _N. J. A. Sloane_