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!)
A241759 Number of partitions of n into distinct parts of the form 3^k - 2^k, cf. A001047. 5

%I #11 Jan 24 2017 20:29:00

%S 1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,

%T 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,

%U 0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1

%N Number of partitions of n into distinct parts of the form 3^k - 2^k, cf. A001047.

%C a(A241783(n)) = 0; a(A240400(n)) > 0.

%H Reinhard Zumkeller, <a href="/A241759/b241759.txt">Table of n, a(n) for n = 0..10000</a>

%F G.f.: Product_{k>=1} (1 + x^(3^k-2^k)). - _Ilya Gutkovskiy_, Jan 23 2017

%t nmax = 200; CoefficientList[Series[Product[1 + x^(3^k-2^k), {k, 1, Floor[Log[nmax]/Log[2]] + 1}], {x, 0, nmax}], x] (* _Vaclav Kotesovec_, Jan 24 2017 *)

%o (Haskell)

%o a241759 = p $ tail a001047_list where

%o p _ 0 = 1

%o p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m

%Y Cf. A001047, A241766.

%K nonn

%O 0

%A _Reinhard Zumkeller_, Apr 28 2014

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 April 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)