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 A377170 #33 Jun 15 2025 19:32:07 %S A377170 0,1,4,12,36,98,250,616,1484,3508,8140,18620,42164,94632,210518, %T A377170 464840,1020556,2229014,4843316,10476164,22576728,48489154,103790370, %U A377170 221484824,471427432,1001027226,2120503144,4482083616,9455815160,19913405076,41862056992,87857540836 %N A377170 Sum of the nonnegative terms in the n-th row of A365968. %C A377170 By symmetry -a(n) is the sum of the nonpositive terms in the n-th row of A365968. %H A377170 Alois P. Heinz, <a href="/A377170/b377170.txt">Table of n, a(n) for n = 0..1000</a> %F A377170 a(n) = (1/2) * Sum_{k=0..2^n-1} abs(A365968(n,k)). %F A377170 a(n) = (1/2) * Sum_{i=0..2^n-1} abs(A384868(i+2^n-1)). - _Alois P. Heinz_, Jun 13 2025 %e A377170 The 4th row of A365968 is: [-10, -8, -6, -4, -4, -2, 0, 2, -2, 0, 2, 4, 4, 6, 8, 10], so a(4) = 2 + 2 + 4 + 4 + 6 + 8 + 10 = 36. %p A377170 b:= proc(n, s) option remember; `if`(n=0, s, %p A377170 b(n-1, abs(s-n))+b(n-1, s+n)) %p A377170 end: %p A377170 a:= n-> b(n, 0)/2: %p A377170 seq(a(n), n=0..31); # _Alois P. Heinz_, Jun 13 2025 %Y A377170 Cf. A000079, A365968, A367076, A384868. %K A377170 nonn,easy %O A377170 0,3 %A A377170 _John Tyler Rascoe_, Oct 18 2024