Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035362
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A035362
%S A035362 1,1,1,2,3,3,3,5,7,8,8,11,15,17,18,23,30,35,37,45,57,66,71,84,104,121,
%T A035362 131,151,183,212,231,263,313,362,396,446,523,601,660,738,855,979,1076,
%U A035362 1196,1372,1562,1719,1903,2164,2454,2701,2979,3363,3795,4177,4594
%N A035362 Number of partitions of n into parts 4k or 4k+1.
%C A035362 Also number of partitions of n such that number of 1's plus number of 
               odd parts is greater than or equal to n. - Vladeta Jovovic (vladeta(AT)eunet.rs), 
               Feb 27 2006
%F A035362 G.f.=-1+1/[(1-x)product((1-x^(4j))(1-x^(4j+1)), j=1..infinity)]. - Emeric 
               Deutsch (deutsch(AT)duke.poly.edu), Mar 07 2006
%e A035362 a(8)=5 because we have [8],[5,1,1,1],[4,4],[4,1,1,1,1] and [1,1,1,1,1,
               1,1,1].
%p A035362 g:=-1+1/(1-x)/product((1-x^(4*j))*(1-x^(4*j+1)),j=1..20): gser:=series(g,
               x=0,60): seq(coeff(gser,x^n),n=1..56); - Emeric Deutsch (deutsch(AT)duke.poly.edu), 
               Mar 07 2006
%Y A035362 Sequence in context: A036020 A036024 A036029 this_sequence A042957 A131048 
               A126868
%Y A035362 Adjacent sequences: A035359 A035360 A035361 this_sequence A035363 A035364 
               A035365
%K A035362 nonn
%O A035362 1,4
%A A035362 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 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research