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
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, 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, 20, 8, 21, 11, 20, 8, 21, 7, 22, 11, 22, 11, 23, 10, 28, 12, 24, 11 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
MATHEMATICA
f[n_] := Length@ IntegerPartitions[n, {2, 3}, Prime@ Range@ PrimePi@ n]; Array[f, 80]
CROSSREFS
Sequence in context: A272851 A242258 A232615 * A243423 A094528 A077774
KEYWORD
nonn,easy
AUTHOR
Robert G. Wilson v, Apr 17 2015
STATUS
approved

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 August 24 14:29 EDT 2024. Contains 375415 sequences. (Running on oeis4.)