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.

A294295 Number of ways to write A294294(n) as a sum of 3 odd primes p+q+r, with p>=q>=r.

This page as a plain text file.
%I A294295 #5 Oct 29 2017 13:33:08
%S A294295 0,1,2,3,4,5,6,7,9,10,11,12,14,16,18,20,21,24,25,27,28,29,30,34,36,42,
%T A294295 45,46,48,55,58,60,64,68,72,81,85,88,90,93,101,107,110,119,122,128,
%U A294295 134,142,143,145,150,161,162,169,179,181,195,196,215
%N A294295 Number of ways to write A294294(n) as a sum of 3 odd primes p+q+r, with p>=q>=r.
%H A294295 Hugo Pfoertner, <a href="/A294295/b294295.txt">Table of n, a(n) for n = 1..301</a>
%F A294295 a(n) = A007963((A294294(n)-1)/2).
%Y A294295 Cf. A007963, A294294.
%K A294295 nonn
%O A294295 1,3
%A A294295 _Hugo Pfoertner_, Oct 28 2017