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 A030588 #18 Apr 09 2020 23:51:25 %S A030588 1,3,5,1,1,1,3,1,5,2,1,2,3,2,5,3,1,3,3,3,5,4,1,4,3,4,5,5,1,5,3,5,5,1, %T A030588 0,1,1,0,3,1,0,5,1,1,1,1,1,3,1,1,5,1,2,1,1,2,3,1,2,5,1,3,1,1,3,3,1,3, %U A030588 5,1,4,1,1,4,3,1,4,5,1,5,1,1,5,3,1,5,5,2,0,1 %N A030588 Write odd numbers in base 6 and juxtapose. %H A030588 Antti Karttunen, <a href="/A030588/b030588.txt">Table of n, a(n) for n = 1..100000</a> %e A030588 From _Antti Karttunen_, Dec 26 2018: (Start) %e A030588 The first twelve odd numbers and their base-6 representations (A007092) are: %e A030588 1 1 %e A030588 3 3 %e A030588 5 5 %e A030588 7 11 %e A030588 9 13 %e A030588 11 15 %e A030588 13 21 %e A030588 15 23 %e A030588 17 25 %e A030588 19 31 %e A030588 21 33 %e A030588 23 35 %e A030588 thus the sequence begins with terms 1, 3, 5, 1, 1, 1, 3, 1, 5, 2, 1, 2, 3, 2, 5, 3, 1, 3, 3, 3, 5. %e A030588 (End) %t A030588 Flatten[Table[IntegerDigits[2n - 1, 6], {n, 50}]] (* _Harvey P. Dale_, Jul 22 2012 *) %o A030588 (PARI) %o A030588 up_to = 100000; %o A030588 A030588list(up_to) = { my(v=vector(up_to),ds=List([]),o=1,j=1); for(i=1,up_to,if(j>#ds,ds=digits(o,6);j=1;o+=2); v[i] = ds[j]; j++); (v); }; %o A030588 v030588 = A030588list(up_to); %o A030588 A030588(n) = v030588[n]; \\ _Antti Karttunen_, Dec 24 2018 %o A030588 (Scala) (1 to 99 by 2).map(Integer.toString(_, 6).toCharArray).flatten // _Alonso del Arte_, Apr 02 2020 %Y A030588 Cf. A007092. %Y A030588 Cf. A030589, A030590, A030591, A030592, A030593, A030594. %Y A030588 Cf. A030595, A030601, A030602, A030603. %Y A030588 Cf. A030596, A030597, A030598, A030599, A030600. %K A030588 nonn,base,easy %O A030588 1,2 %A A030588 _Clark Kimberling_