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!)
A059339 A+B=C for 0<=A, 0<=B, A<=B; if n is a C-almost prime then a(n) = number of decompositions of n into sum of an A-almost prime and a B-almost prime. 1

%I #3 Mar 31 2012 13:50:36

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

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

%U 1,6,0,4,0,5,8,10,0,5,0,6,13,5,0,7,1,6,1,8,0,6,1,11,0,6,1,7,0,13,10,11,0

%N A+B=C for 0<=A, 0<=B, A<=B; if n is a C-almost prime then a(n) = number of decompositions of n into sum of an A-almost prime and a B-almost prime.

%C E.g. n=10, 10 is 2-almost prime (semiprime). Therefore C=2. 10=1+9(A=0,B=2); 10=7+3(A=1,B=1); 10=5+5(A=1,B=1), so a(10)=3.

%K easy,nonn

%O 1,10

%A _Naohiro Nomoto_, Jan 27 2001

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 July 18 03:34 EDT 2024. Contains 374377 sequences. (Running on oeis4.)