login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257177 Number of partitions of n into 2 or 3 primes. 0

%I #4 Apr 20 2015 13:24:38

%S 0,0,0,1,1,2,2,2,3,3,2,3,3,3,4,4,4,4,4,4,6,5,5,6,6,6,7,5,7,5,7,5,10,6,

%T 8,8,9,6,11,5,11,7,11,7,13,7,13,9,13,9,15,7,16,8,15,8,17,7,16,10,17,9,

%U 20,8,21,11,20,8,21,7,22,11,22,11,23,10,28,12,24,11

%N Number of partitions of n into 2 or 3 primes.

%t f[n_] := Length@ IntegerPartitions[n, {2, 3}, Prime@ Range@ PrimePi@ n]; Array[f, 80]

%Y Cf. A002375, A068307, A083338, A000607.

%K nonn,easy

%O 1,6

%A _Robert G. Wilson v_, Apr 17 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 11:45 EDT 2024. Contains 371278 sequences. (Running on oeis4.)