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!)
A117193 Number of partitions of n into distinct parts with an odd rank. 12
0, 1, 0, 2, 1, 2, 2, 4, 4, 4, 6, 8, 10, 10, 13, 16, 20, 22, 28, 32, 38, 43, 52, 62, 72, 82, 96, 110, 128, 148, 170, 196, 224, 256, 292, 334, 380, 432, 490, 557, 630, 714, 806, 908, 1022, 1152, 1294, 1456, 1632, 1830, 2049, 2290, 2560, 2860, 3188, 3554, 3958, 4404 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = Sum(A117195(n,k)*(k mod 2): 0<=k<n).
a(n) = A000009(n) - A117192(n).
a(n) = A117192(n) - A003406(n).
MATHEMATICA
a[n_] := Count[IntegerPartitions[n], q_ /; OddQ[First[q] - Length[q]] && Length[q] == Length[Union[q]]];
Array[a, 60] (* Jean-François Alcover, Oct 06 2021 *)
CROSSREFS
Sequence in context: A204596 A324387 A163373 * A325707 A026832 A225044
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 03 2006
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 2 07:06 EDT 2024. Contains 372178 sequences. (Running on oeis4.)