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 A316355 #22 Jul 20 2022 08:52:36 %S A316355 0,1,1,2,3,3,3,3,4,5,5,5,5,5,5,6,7,7,7,7,7,7,7,7,8,9,9,9,9,9,9,9,9,9, %T A316355 9,10,11,11,11,11,11,11,11,11,11,11,11,11,12,13,13,13,13,13,13,13,13, %U A316355 13,13,13,13,13,13,14,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,16 %N A316355 2k-1 appears 2k times after 2k-2 appears once. %H A316355 Seiichi Manyama, <a href="/A316355/b316355.txt">Table of n, a(n) for n = 0..10000</a> %F A316355 a(k^2-1) = 2k-2. %F A316355 G.f.: ((1+x)*Theta_3(0,x)-1-3*x)/(2*x-2*x^2) where Theta_3 is a Jacobi Theta function. - _Robert Israel_, Jul 01 2018 %p A316355 seq(op([2*k-2,(2*k-1)$(2*k)]),k=1..10); # _Robert Israel_, Jul 01 2018 %Y A316355 Cf. A005563, A316354. %Y A316355 Essentially partial sums of A267006. %K A316355 nonn %O A316355 0,4 %A A316355 _Seiichi Manyama_, Jun 30 2018