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 A080605 #16 Apr 04 2015 02:40:44 %S A080605 1,3,3,3,5,5,5,7,7,7,9,9,9,9,9,11,11,11,11,11,13,13,13,13,13,15,15,15, %T A080605 15,15,15,15,17,17,17,17,17,17,17,19,19,19,19,19,19,19,21,21,21,21,21, %U A080605 21,21,21,21,23,23,23,23,23,23,23,23,23,25,25,25,25,25,25,25,25,25,27 %N A080605 Golomb's sequence using odd integers. %H A080605 Ivan Neretin, <a href="/A080605/b080605.txt">Table of n, a(n) for n = 1..10000</a> %F A080605 a(n) = tau^(2-tau)*(2n)^(tau-1)+O(n^(tau-1)/log(n)) where tau is the golden ratio. %e A080605 Read 1,3,3,3,5,5,5,7,7,7,9,9,9,9,9,11,11,11,11,11, as 1,(3,3,3),(5,5,5),(7,7,7),(9,9,9,9,9),(11,11,11,11,11), count occurrences between 2 parentheses, gives 1,3,3,3,5,5,... which is the sequence itself. %o A080605 (PARI) a=[1,3,3,3];for(n=3,20,for(i=1,a[n],a=concat(a,2*n-1)));a %Y A080605 Cf. A001462, A080606, A080607. %K A080605 nonn %O A080605 1,2 %A A080605 _Benoit Cloitre_, Feb 25 2003 %E A080605 Corrected at the suggestion of Kevin Ryde by _Benoit Cloitre_, May 31 2012