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!)
A111335 Let qf(a,q) = Product_{j>=0} (1 - a*q^j); g.f. is qf(q^3,q^4)/qf(q,q^4). 4

%I #21 Sep 29 2023 02:17:47

%S 1,1,1,0,0,1,1,0,-1,0,2,1,-1,-1,1,2,-1,-2,1,3,1,-3,-1,3,1,-3,-2,4,4,

%T -3,-4,3,5,-3,-7,2,9,0,-9,-1,10,3,-11,-5,12,8,-11,-10,10,12,-11,-15,

%U 11,19,-7,-21,6,24,-5,-28,1,31,4,-33,-8,36,12,-38,-18,40,27,-40,-33,40,39,-40,-49,38,60,-34,-67,30,75,-25,-87,18,98

%N Let qf(a,q) = Product_{j>=0} (1 - a*q^j); g.f. is qf(q^3,q^4)/qf(q,q^4).

%H Alois P. Heinz, <a href="/A111335/b111335.txt">Table of n, a(n) for n = 0..1000</a>

%F Euler transform of period 4 sequence [1, 0, -1, 0, ...]. - _Michael Somos_, Nov 10 2005

%F G.f.: Product_{k>0} (1-x^(2k-1))^((-1)^k). - _Michael Somos_, Nov 11 2005

%F G.f.: exp( Sum_{k >= 1} 1/(k*(x^k + x^(-k)) ). - _Peter Bala_, Sep 28 2023

%p # Uses EulerTransform from A358369.

%p a := EulerTransform(BinaryRecurrenceSequence(0, -1)):

%p seq(a(n), n=0..86); # _Peter Luschny_, Nov 17 2022

%o (PARI) {a(n)=if(n<0, 0, polcoeff( prod(k=0,n\2, (1-x^(2*k+1))^(-(-1)^k), 1+x*O(x^n)), n))} /* _Michael Somos_, Nov 11 2005 */

%o (Sage) # uses[EulerTransform from A166861]

%o b = BinaryRecurrenceSequence(0, -1)

%o a = EulerTransform(b)

%o print([a(n) for n in range(87)]) # _Peter Luschny_, Nov 17 2022

%Y Cf. A111330.

%K sign

%O 0,11

%A _N. J. A. Sloane_, Nov 09 2005

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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)