Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036029
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A036029
%S A036029 0,0,1,1,1,1,2,3,3,3,5,7,7,8,12,15,16,19,25,31,35,40,50,62,69,80,99,
%T A036029 117,133,154,184,217,247,283,335,391,443,507,593,685,776,886,1024,1175,
%U A036029 1331,1510,1733,1980,2232,2526,2883,3271,3682,4154,4710,5324
%N A036029 Number of partitions of n into parts not of form 4k+2, 24k, 24k+1 or 
               24k-1. Also number of partitions in which no odd part is repeated, 
               with no part of size less than or equal to 2 and where differences 
               between parts at distance 5 are greater than 1 when the smallest 
               part is odd and greater than 2 when the smallest part is even.
%C A036029 Case k=6,i=1 of Gordon/Goellnitz/Andrews Theorem.
%D A036029 G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 114.
%Y A036029 Sequence in context: A000025 A036020 A036024 this_sequence A035362 A042957 
               A131048
%Y A036029 Adjacent sequences: A036026 A036027 A036028 this_sequence A036030 A036031 
               A036032
%K A036029 nonn,easy
%O A036029 1,7
%A A036029 Olivier Gerard (olivier.gerard(AT)gmail.com)

    
page 1

Search completed in 0.001 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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research