Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130690
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130690 Number of partitions of n such that the largest part is coprime to every other part. +0
1
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; listen)
OFFSET

0,3

FORMULA

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

CROSSREFS

Sequence in context: A111243 A108917 A113243 this_sequence A074885 A091336 A002235

Adjacent sequences: A130687 A130688 A130689 this_sequence A130691 A130692 A130693

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 01 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research