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!)
A340285 Number of partitions of n into 3 parts such that the largest part is relatively prime to each of the other two parts. 2
0, 0, 1, 1, 1, 2, 2, 3, 3, 5, 5, 7, 6, 9, 8, 11, 10, 16, 12, 18, 15, 20, 19, 28, 21, 30, 25, 34, 27, 44, 30, 44, 36, 50, 39, 60, 43, 62, 51, 69, 52, 85, 56, 83, 68, 86, 68, 109, 71, 109, 84, 110, 84, 138, 91, 132, 105, 138, 104, 176, 111, 162, 131, 171, 127, 204, 129, 193 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} floor(1/gcd(n-i-k,k)) * floor(1/gcd(n-i-k,i)).
MATHEMATICA
Table[Sum[Sum[Floor[1/GCD[n - i - k, k]]*Floor[1/GCD[n - i - k, i]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 80}]
CROSSREFS
Sequence in context: A304430 A086609 A341140 * A341462 A035031 A035032
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jan 02 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 May 23 00:54 EDT 2024. Contains 372758 sequences. (Running on oeis4.)