Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078408
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A078408
%S A078408 1,2,3,5,8,12,18,27,38,54,76,104,142,192,256,340,448,585,760,982,1260,
%T A078408 1610,2048,2590,3264,4097,5120,6378,7917,9792,12076,14848,18200,22250,
%U A078408 27130,32992,40026,48446,58499,70488,84756,101698,121792,145578,173682
%N A078408 Number of ways to partition 2n+1 into distinct positive integers.
%C A078408 Euler transform of period 16 sequence [2,0,1,1,1,1,2,0,2,1,1,1,1,0,2,
               0,...]. - Michael Somos, Mar 04 2003
%F A078408 a(n) = t(2*n+1, 0), t as defined in A079211.
%F A078408 Odd entries of A000009. G.f.: 1/[(1-x)(1-x^3)(1-x^5)...] - Jon Perry 
               (perry(AT)globalnet.co.uk), May 27 2004
%o A078408 (PARI) a(n)=local(X); if(n<0,0,X=x+O(x^(2*n+2)); polcoeff(eta(X^2)/eta(X),
               2*n+1))
%Y A078408 Cf. A035294, A078409, A078410. a(n)=A000009(2n+1).
%Y A078408 Sequence in context: A122928 A001524 A136275 this_sequence A007478 A014605 
               A132842
%Y A078408 Adjacent sequences: A078405 A078406 A078407 this_sequence A078409 A078410 
               A078411
%K A078408 nonn,easy
%O A078408 0,2
%A A078408 N. J. A. Sloane (njas(AT)research.att.com), Dec 27 2002
%E A078408 More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Dec 28 2002

    
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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research