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!)
A340283 Number of partitions of n into 3 parts such that the smallest part is relatively prime to each of the other two parts. 2

%I #5 Jan 03 2021 15:54:48

%S 0,0,1,1,2,2,3,4,4,5,6,8,7,10,9,12,11,17,13,20,16,21,18,29,21,31,26,

%T 35,27,46,29,46,37,50,39,62,40,63,51,70,50,87,54,85,69,88,65,112,71,

%U 111,84,112,81,140,89,134,103,138,99,178,105,164,131,171,126,207,125,195,152

%N Number of partitions of n into 3 parts such that the smallest part is relatively prime to each of the other two parts.

%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>

%F a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} floor(1/gcd(k,i)) * floor(1/gcd(k,n-i-k)).

%t Table[Sum[Sum[Floor[1/GCD[k, i]]*Floor[1/GCD[k, n - i - k]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 80}]

%Y Cf. A340284, A340285.

%K nonn

%O 1,5

%A _Wesley Ivan Hurt_, Jan 02 2021

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 May 17 00:45 EDT 2024. Contains 372555 sequences. (Running on oeis4.)