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 A131205 #50 Sep 23 2024 12:08:09
%S A131205 1,3,7,13,23,37,57,83,119,165,225,299,393,507,647,813,1015,1253,1537,
%T A131205 1867,2257,2707,3231,3829,4521,5307,6207,7221,8375,9669,11129,12755,
%U A131205 14583,16613,18881,21387,24177,27251,30655,34389,38513,43027,47991
%N A131205 a(n) = a(n-1) + a(floor(n/2)) + a(ceiling(n/2)).
%C A131205 From _Gary W. Adamson_, Dec 16 2009: (Start)
%C A131205 Let M = an infinite lower triangular matrix with (1, 3, 4, 4, 4, ...) in every column shifted down twice, with the rest zeros:
%C A131205 1;
%C A131205 3, 0;
%C A131205 4, 1, 0;
%C A131205 4, 3, 0, 0;
%C A131205 4, 4, 1, 0, 0;
%C A131205 4, 4, 3, 0, 0, 0;
%C A131205 ...
%C A131205 A131205 = lim_{n->infinity} M^n, the left-shifted vector considered as a sequence. (End)
%C A131205 The subsequence of primes in this sequence begins with 5 in a row: 3, 7, 13, 23, 37, 83, 647, 1867, 2707, 88873, 388837, 655121, 754903, 928621, 1062443. - _Jonathan Vos Post_, Apr 25 2010
%H A131205 T. D. Noe, <a href="/A131205/b131205.txt">Table of n, a(n) for n = 1..1000</a>
%H A131205 Cristina Ballantine, George Beck, and Mircea Merca, <a href="https://arxiv.org/abs/2408.13346">Partitions and elementary symmetric polynomials -- an experimental approach</a>, arXiv:2408.13346 [math.CO], 2024. See p. 13.
%H A131205 Cristina Ballantine, George Beck, Mircea Merca, and Bruce Sagan, <a href="https://arxiv.org/abs/2409.11268">Elementary symmetric partitions</a>, arXiv:2409.11268 [math.CO], 2024. See pp. 5, 7.
%F A131205 Partial sums of A000123. - _Gary W. Adamson_, Oct 26 2007
%F A131205 G.f.: r(x) * r(x^2) * r(x^4) * r(x^8) * ... where r(x) = (1 + 3x + 4x^2 + 4x^3 + 4x^4 + ...) is the g.f. of A113311. - _Gary W. Adamson_, Sep 01 2016
%F A131205 G.f.: (x/(1 - x))*Product_{k>=0} (1 + x^(2^k))/(1 - x^(2^k)). - _Ilya Gutkovskiy_, Jun 05 2017
%F A131205 a(n) = A033485(2n-1). - _Jean-Paul Allouche_, Aug 11 2021
%p A131205 A[1]:= 1:
%p A131205 for n from 2 to 100 do A[n]:= A[n-1] + A[floor(n/2)] + A[ceil(n/2)] od:
%p A131205 seq(A[n],n=1..100); # _Robert Israel_, Sep 06 2016
%t A131205 Nest[Append[#1, #1[[-1]] + #1[[Floor@ #3]] + #[[Ceiling@ #3]] ] & @@ {#1, #2, #2/2} & @@ {#, Length@ # + 1} &, {1}, 42] (* _Michael De Vlieger_, Jan 16 2020 *)
%o A131205 (Haskell)
%o A131205 a131205 n = a131205_list !! (n-1)
%o A131205 a131205_list = scanl1 (+) a000123_list -- _Reinhard Zumkeller_, Oct 10 2013
%Y A131205 Cf. A000123, A008619. Bisection of A033485.
%K A131205 nonn
%O A131205 1,2
%A A131205 _Reinhard Zumkeller_, Oct 22 2007