# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a100505 Showing 1-1 of 1 %I A100505 #19 Apr 04 2023 07:46:37 %S A100505 1,2,8,27,79,209,512,1183,2604,5504,11240,22277,43003,81098,149769, %T A100505 271404,483439,847681,1464999,2498258,4207764,7005688,11538936, %U A100505 18814423,30387207,48641220,77205488,121567834,189974638,294742961,454164484,695254782,1057704607 %N A100505 Bisection of A001523. %H A100505 Alois P. Heinz, Table of n, a(n) for n = 0..5000 %p A100505 seq(coeff(convert(series(1+add(-(-1)^k*x^(k*(k+1)/2),k=1..100)/(mul(1-x^k,k=1..100))^2,x,100),polynom),x,2*n),n=0..45); # (C. Ronaldo) %p A100505 # second Maple program: %p A100505 b:= proc(n, i) option remember; %p A100505 `if`(i>n, 0, `if`(irem(n, i)=0, 1, 0)+ %p A100505 add(b(n-i*j, i+1)*(j+1), j=0..n/i)) %p A100505 end: %p A100505 a:= n-> `if`(n=0, 1, b(2*n, 1)): %p A100505 seq(a(n), n=0..60); # _Alois P. Heinz_, Mar 26 2014 %t A100505 max = 70; s = 1 + Sum[(-1)^(k+1)*q^(k*(k+1)/2), {k, 1, Sqrt[2 max] // Ceiling}]/QPochhammer[q]^2 + O[q]^max // Normal; Partition[(List @@ s) /. q -> 1, 2][[All, 1]] (* _Jean-François Alcover_, Apr 04 2017 *) %o A100505 (Magma) %o A100505 m:=200; %o A100505 R:=PowerSeriesRing(Integers(), m); %o A100505 b:=Coefficients(R!( 1 + (&+[ x^n*(1-x^n)/(&*[(1-x^j)^2: j in [1..n]]): n in [1..m+2]]) )); %o A100505 A100505:= func< n | b[2*n+1] >; %o A100505 [A100505(n): n in [0..80]]; // _G. C. Greubel_, Apr 03 2023 %o A100505 (SageMath) %o A100505 @CachedFunction %o A100505 def b(n, k): # Indranil Ghosh's code of A001523 %o A100505 if k>n: return 0 %o A100505 if n%k==0: x=1 %o A100505 else: x=0 %o A100505 return x + sum(b(n-k*j, k+1)*(j+1) for j in range(n//k + 1)) %o A100505 def A100505(n): return 1 if n==0 else b(2*n, 1) %o A100505 [A100505(n) for n in range(81)] # _G. C. Greubel_, Apr 03 2023 %Y A100505 Cf. A001523, A100506. %K A100505 nonn,easy %O A100505 0,2 %A A100505 _N. J. A. Sloane_, Nov 24 2004 %E A100505 More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 19 2005 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE