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 A181849 #20 Jun 18 2024 18:14:06 %S A181849 1,1,3,8,19,49,112,273,631,1450,3327,7571,17170,38519,85951,190392, %T A181849 419759,921189,2013874,4385889,9516273,20577618,44352499,95324853, %U A181849 204307052,436768151,931448065,1981879262,4207887155,8916102661,18856430826,39807226901,83892649091 %N A181849 Row sums of A181851. %H A181849 Alois P. Heinz, <a href="/A181849/b181849.txt">Table of n, a(n) for n = 0..150</a> %p A181849 with(combstruct): %p A181849 a181849 := proc(n) local k,L,l,comp; %p A181849 L := 1-signum(n); %p A181849 for k from 1 to n do %p A181849 comp := iterstructs(Composition(n),size=k): %p A181849 while not finished(comp) do %p A181849 l := nextstruct(comp); %p A181849 L := L + ilcm(op(l)); %p A181849 od; %p A181849 od; %p A181849 L end: %p A181849 seq(a181849(n), n=0..15); %t A181849 c[n_, k_] := Permutations /@ IntegerPartitions[n, {k}] // Flatten[#, 1]&; t[n_, k_] := Total[LCM @@@ c[n, k]]; Table[Print[s = Sum[t[n, k], {k, 1, n}]]; s, {n, 1, 25}] (* _Jean-François Alcover_, Feb 05 2014 *) %Y A181849 Cf. A181850, A181851. %K A181849 nonn %O A181849 0,3 %A A181849 _Peter Luschny_, Dec 07 2010 %E A181849 a(23)-a(25) from _Alois P. Heinz_, Jul 29 2013 %E A181849 a(0), a(26)-a(32) from _Alois P. Heinz_, Jun 18 2024