login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089251 Number of elements e in all partitions of n such that e divides n. 0
1, 3, 5, 11, 13, 32, 31, 71, 83, 147, 140, 364, 273, 550, 681, 1108, 916, 2157, 1598, 3604, 3549, 5102, 4509, 11548, 8192, 13514, 15199, 24911, 18461, 45062, 28630, 59662, 56544, 78484, 79350, 167219, 99134, 175771, 189108, 331455, 215309 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

Sum_{d|n} Sum_{k=1..d} A000041(n-n*k/d). - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 23 2005

a(n) = sum_{d | n} A066633(n, d). - David Wasserman (wasserma(AT)spawar.navy.mil), Aug 31 2005

EXAMPLE

a(4)=11 as partitions are 4,31,22,211,1111 - 12 elements in total of which only 3 does not divide 4.

MATHEMATICA

f[n_] := Block[{d = Divisors[n]}, Plus @@ Sum[ PartitionsP[n - n*k/d], {k, n}]]; Table[ f[n], {n, 36}] (from Robert G. Wilson v Mar 24 2005)

CROSSREFS

Sequence in context: A153075 A095082 A105071 * A147568 A006794 A032457

Adjacent sequences:  A089248 A089249 A089250 * A089252 A089253 A089254

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Dec 12 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Aug 31 2005

Edited by N. J. A. Sloane (njas(AT)research.att.com), Aug 29 2008 at the suggestion of R. J. Mathar

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:59 EST 2012. Contains 205788 sequences.