cp's OEIS Frontend

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.

A308854 Sum of all the parts in the partitions of n into 5 primes.

This page as a plain text file.
%I A308854 #14 Apr 19 2022 09:39:16
%S A308854 0,0,0,0,0,0,0,0,0,0,10,11,12,26,28,45,48,51,54,95,80,126,132,161,144,
%T A308854 250,182,297,252,348,330,527,352,594,442,700,504,888,570,1053,720,
%U A308854 1189,882,1505,836,1710,1104,1927,1248,2303,1300,2703,1560,2862,1836
%N A308854 Sum of all the parts in the partitions of n into 5 primes.
%H A308854 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A308854 a(n) = n * Sum_{l=1..floor(n/5)} Sum_{k=l..floor((n-l)/4)} Sum_{j=k..floor((n-k-l)/3)} Sum_{i=j..floor((n-j-k-l)/2)} c(l) * c(k) * c(j) * c(i) * c(n-i-j-k-l), where c = A010051.
%F A308854 a(n) = n * A259195(n).
%F A308854 a(n) = A308855(n) + A308856(n) + A308857(n) + A308858(n) + A308859(n).
%t A308854 Table[Total[Flatten[Select[IntegerPartitions[n,{5}],AllTrue[#,PrimeQ]&]]],{n,0,60}] (* _Harvey P. Dale_, Apr 18 2022 *)
%Y A308854 Cf. A010051, A259195, A308855, A308856, A308857, A308858, A308859.
%K A308854 nonn
%O A308854 0,11
%A A308854 _Wesley Ivan Hurt_, Jun 28 2019