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 A077138 #40 Feb 13 2022 10:55:56 %S A077138 0,1,2,5,20,25,150,157,1256,1265,12650,12661,151932,151945,2127230, %T A077138 2127245,34035920,34035937,612646866,612646885,12252937700, %U A077138 12252937721,269564629862,269564629885,6469551117240,6469551117265,168208329048890 %N A077138 a(0) = 0. If n is odd, a(n) = a(n-1) + n, otherwise a(n) = a(n-1) * n. %H A077138 William Boyles, <a href="/A077138/b077138.txt">Table of n, a(n) for n = 0..1000</a> [Terms 0 through 26 were computed by Amarnath Murthy; terms 27 through 1000 were computed by William Boyles, Nov 27 2016] %F A077138 a(0) = 0, a(2n) = 2n*a(2n-1) and a(2n+1) = a(2n) +(2n +1). %t A077138 a = 0; Table[If[OddQ[n], a = n + a, a = n*a], {n, 0, 30}] (* _T. D. Noe_, Feb 26 2013 *) %t A077138 nxt[{n_,a_}]:={n+1,If[EvenQ[n],a+n+1,a(n+1)]}; NestList[nxt,{0,0},30][[All,2]] (* _Harvey P. Dale_, Feb 13 2022 *) %o A077138 (PARI) a(n)=if(n<0,0,if(n%2,n+a(n-1),n*a(n-1))) %o A077138 (Python) %o A077138 a=0 %o A077138 for n in range(1, 33): %o A077138 print(a, end=', ') %o A077138 if n&1: %o A077138 a += n %o A077138 else: %o A077138 a *= n %Y A077138 Cf. A047904, A047905, A222559. %K A077138 nonn,easy %O A077138 0,3 %A A077138 _Amarnath Murthy_, Oct 30 2002 %E A077138 Name improved by _T. D. Noe_, Feb 26 2013