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!)
A363252 a(n) = gcd(A000041(n), A000009(n)). 0
1, 1, 1, 1, 1, 1, 1, 5, 2, 2, 2, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 2, 3, 2, 2, 1, 4, 2, 3, 7, 2, 3, 1, 1, 1, 1, 21, 21, 2, 1, 1, 2, 6, 14, 3, 1, 2, 1, 1, 1, 1, 2, 1, 3, 4, 4, 17, 1, 2, 1, 2, 2, 4, 1, 3, 5, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 4, 1, 1, 1, 2, 11, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
MAPLE
b:= proc(n) option remember; `if`(n=0, 1, add(b(n-j)*add(
`if`(d::odd, d, 0), d=numtheory[divisors](j)), j=1..n)/n)
end:
a:= n-> igcd(b(n), combinat[numbpart](n)):
seq(a(n), n=0..120); # Alois P. Heinz, May 23 2023
MATHEMATICA
Table[GCD[PartitionsP[n], PartitionsQ[n]], {n, 0, 100}]
CROSSREFS
Sequence in context: A306966 A286016 A119320 * A070962 A093008 A297827
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, May 23 2023, inspired by Zhi-Wei Sun
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 6 00:30 EDT 2024. Contains 373110 sequences. (Running on oeis4.)