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 A113153 #20 Jul 25 2024 08:40:06
%S A113153 1,2,4,8,17,54,472,27216,84738887,299164114847940,
%T A113153 311903053042108587337426568,
%U A113153 5846720173185251353387753850814872871131756204168
%N A113153 Sum of the first n nonzero tribonacci numbers, in ascending order, as bases, with the same, in descending order, as exponents.
%F A113153 a(n) = Sum_{i=1..n} A000073(i+1)^A000073(n-i+2).
%e A113153 For the tribonacci sequence starting t(1)=t(2)=1, t(3)=2, that is, the nonzero terms of A000073:
%e A113153 a(1) = t(1)^t(1) = 1^1 = 1.
%e A113153 a(2) = t(1)^t(2) + t(2)^t(1) = 1^1 + 1^1 = 2.
%e A113153 a(3) = t(1)^t(3) + t(2)^t(2) + t(3)^t(1) = 1^2 + 1^1 + 2^1 = 4.
%e A113153 a(4) = t(1)^t(4) + t(2)^t(3) + t(3)^t(2) + t(4)^t(1) = 1^4 + 1^2 + 2^1 + 4^1 = 8.
%e A113153 a(5) = 1^7 + 1^4 + 2^2 + 4^1 + 7^1 = 17.
%e A113153 a(6) = 1^13 + 1^7 + 2^4 + 4^2 + 7^1 + 13^1 = 54.
%t A113153 a[0] = a[1] = 0 ; a[2] = 1; a[n_] := a[n] = a[n - 1] + a[n - 2] + a[n - 3]; Table[Sum[a[k + 2]^(a[n - k + 1]), {k, 1, n}], {n, 1, 10}] (* _G. C. Greubel_, May 18 2017 *)
%Y A113153 Cf. A000073.
%K A113153 easy,nonn
%O A113153 1,2
%A A113153 _Jonathan Vos Post_, Jan 04 2006
%E A113153 Name clarified by _Arthur O'Dwyer_, Jul 24 2024