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!)
A340754 Number of partitions of n into 4 parts such that the sum of the smallest two parts and the sum of the largest two parts are relatively prime. 0
0, 0, 0, 0, 0, 1, 0, 3, 1, 4, 2, 11, 1, 18, 7, 14, 11, 39, 10, 54, 14, 40, 31, 94, 26, 99, 53, 101, 49, 185, 34, 225, 102, 162, 123, 220, 96, 378, 174, 269, 160, 511, 117, 588, 229, 354, 314, 764, 235, 747, 318, 607, 395, 1089, 340, 882, 487, 849, 640, 1495, 406, 1650 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
FORMULA
a(n) = Sum_{k=1..floor(n/4)} Sum_{j=k..floor((n-k)/3)} Sum_{i=j..floor((n-j-k)/2)} floor(1/gcd(k+j,n-k-j)).
MATHEMATICA
Table[Sum[Sum[Sum[Floor[1/GCD[k + j, n - k - j]], {i, j, Floor[(n - j - k)/2]}], {j, k, Floor[(n - k)/3]}], {k, Floor[n/4]}], {n, 0, 80}]
CROSSREFS
Sequence in context: A068028 A240058 A275896 * A163359 A065256 A016573
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jan 19 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 April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)