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 A098861 #11 Jul 07 2016 23:54:48 %S A098861 0,0,0,1,0,1,2,0,3,1,2,4,0,5,3,1,6,2,4,7,0,8,5,3,9,1,10,6,2,11,4,7,12, %T A098861 0,13,8,5,14,3,9,15,1,16,10,6,17,2,18,11,4,19,7,12,20,0 %N A098861 a(n) = row number in Stolarsky array that contains n. If the first occurrence of a number in the sequence is deleted, the sequence remains unchanged. %C A098861 The Stolarsky array is given in A035506: row 0 are the positive Fibonacci numbers; row 1 (resp. 3) are twice (resp. 3 times) these numbers, starting with 4 (resp. 9); row 2 starts 7,11,18,... etc. - _M. F. Hasler_, Nov 05 2014 %D A098861 D. R. Morrison, A Stolarsky Array of Wythoff Pairs, A Collection of Manuscripts Related to the Fibonacci Sequence, edited by V. E. Hoggatt Jr., M. Bicknell-Johnson, published by The Fibonacci Association, (1980) pp. 134-136. %H A098861 Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibGen.html">General Fibonacci Series</a> %H A098861 Casey Mongoven, <a href="http://caseymongoven.com/catalogue/b118.html">Fibonacci Stolarsky Vertical no. 1 (electronic music created with this sequence)</a> %H A098861 Casey Mongoven, <a href="http://ami.ektf.hu/uploads/papers/finalpdf/AMI_41_from175to192.pdf">Sonification of multiple Fibonacci-related sequences</a>, Annales Mathematicae et Informaticae, 41 (2013) pp. 175-192. %Y A098861 Cf. A019586, A035614, A098862. %K A098861 nonn %O A098861 1,7 %A A098861 _Casey Mongoven_, Oct 12 2004; corrected May 02 2005