Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118302
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118302 Number of partitions of n into distinct parts with largest part not congruent to n modulo 2. +0
6
0, 0, 1, 1, 1, 2, 3, 3, 4, 5, 6, 8, 9, 11, 14, 16, 19, 23, 27, 32, 38, 45, 52, 61, 71, 82, 96, 111, 128, 148, 170, 195, 224, 256, 292, 334, 380, 432, 491, 556, 630, 713, 805, 908, 1024, 1152, 1295, 1455, 1632, 1829, 2048, 2291, 2560, 2859, 3189, 3554, 3959, 4404 (list; graph; listen)
OFFSET

1,6

COMMENT

a(2*n) = A026837(2*n), a(2*n+1) = A026838(2*n+1);

a(n) = A000009(n) - A118301(n),

a(A118300(n)) = A118303(n)/2 = A000009(A118300(n))/2.

EXAMPLE

a(11) = #{10+1,8+3,8+2+1,6+5,6+4+1,6+3+2} = 6;

a(12) = #{11+1,9+3,9+2+1,7+5,7+4+1,7+3+2,5+4+3,5+4+2+1} = 8.

CROSSREFS

Cf. A000701.

Sequence in context: A017864 A029035 A153178 this_sequence A017853 A125616 A141472

Adjacent sequences: A118299 A118300 A118301 this_sequence A118303 A118304 A118305

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 22 2006

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research