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 A360791 #18 Feb 21 2023 16:05:06 %S A360791 1,2,4,14,28,94,218,588,1366,3618,8134,20320,45592,105810,236960, %T A360791 539392,1174530,2612436,5628606,12226350,26130568,55938126,117997774, %U A360791 249680514,523032956,1094500962,2275886514,4727461792,9762182762,20148991512,41403646304,84961079990 %N A360791 Sum of all prime encoded complete partitions of n. %H A360791 Alois P. Heinz, <a href="/A360791/b360791.txt">Table of n, a(n) for n = 0..3316</a> %F A360791 a(n) = Sum_{k=1..A126796(n)} A258118(n,k). %p A360791 b:= proc(n, i) option remember; `if`(i<2, 2^n, `if`(n<2*i-1, %p A360791 b(n, iquo(n+1, 2)), b(n, i-1)+b(n-i, i)*ithprime(i))) %p A360791 end: %p A360791 a:= n-> b(n, iquo(n+1, 2)): %p A360791 seq(a(n), n=0..32); %Y A360791 Row sums of A258118. %Y A360791 Cf. A126796, A215366, A360713. %K A360791 nonn %O A360791 0,2 %A A360791 _Alois P. Heinz_, Feb 21 2023