The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A341973 Number of partitions of n into 2 distinct primes (counting 1 as a prime). 10
1, 1, 1, 1, 1, 2, 1, 1, 0, 2, 1, 2, 1, 2, 0, 3, 1, 3, 1, 2, 0, 4, 1, 2, 0, 2, 0, 4, 1, 3, 1, 3, 0, 4, 0, 2, 1, 3, 0, 5, 1, 4, 1, 3, 0, 6, 1, 4, 0, 3, 0, 6, 1, 3, 0, 3, 0, 7, 1, 3, 1, 5, 0, 6, 0, 3, 1, 5, 0, 7, 1, 5, 1, 5, 0, 7, 0, 5, 1, 4, 0, 9, 1, 4, 0, 4, 0, 10, 1, 4, 0, 4, 0, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,6
LINKS
FORMULA
a(n) = A117929(n) + A010051(n-1). - R. J. Mathar, Oct 01 2021
MAPLE
b:= proc(n, i) option remember; series(`if`(n=0, 1,
`if`(i<0, 0, (p-> `if`(p>n, 0, x*b(n-p, i-1)))(
`if`(i=0, 1, ithprime(i)))+b(n, i-1))), x, 3)
end:
a:= n-> coeff(b(n, numtheory[pi](n)), x, 2):
seq(a(n), n=3..96); # Alois P. Heinz, Feb 24 2021
MATHEMATICA
a[n_] := Select[IntegerPartitions[n, {2}, Join[{1},
Prime[Range[PrimePi[n-1]]]]], #[[1]] != #[[2]]&] // Length;
a /@ Range[3, 100] (* Jean-François Alcover, Jul 13 2021 *)
CROSSREFS
Sequence in context: A277487 A144032 A137686 * A143792 A230121 A029375
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 24 2021
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 June 9 07:31 EDT 2024. Contains 373229 sequences. (Running on oeis4.)