login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130690 Number of partitions of n such that the largest part is coprime to every other part. 0
1, 1, 2, 3, 4, 6, 7, 11, 13, 18, 22, 32, 37, 53, 63, 82, 102, 135, 161, 211, 253, 320, 388, 491, 587, 735, 884, 1088, 1309, 1609, 1922, 2351, 2808, 3401, 4062, 4899, 5828, 7013, 8326, 9955, 11800, 14074, 16627, 19760, 23300, 27575, 32450, 38296, 44935, 52876 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..49.

FORMULA

G.f.: Sum_{n>=0} x^n/Product_{d | gcd(n,d)=1} (1-x^d).

CROSSREFS

Sequence in context: A191930 A202113 A113243 * A308189 A074885 A215231

Adjacent sequences:  A130687 A130688 A130689 * A130691 A130692 A130693

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Jul 01 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 23:05 EDT 2021. Contains 348217 sequences. (Running on oeis4.)